Random minimal spanning tree and percolation on the N-cube

Random Structures and Algorithms

Volumn 12, Issue 1, 1998, Pages 63-82

  Penrose, Mathew D ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Branching process; Minimal spanning tree; N cube; Percolation; Poisson process

Indexed keywords

EID: 0032340782     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199801)12:1<63::AID-RSA4>3.0.CO;2-R     Document Type: Article

References (21)

1. M. Ajtai, J. Komlós, and E. Szemerédi, Largest random component of a k-cube, Combinatorica, 2, 1-7 (1982).
2. D. Aldous, A random tree model associated with random graphs, Random Struct. Alg., 1, 383-402 (1990).
3. D. Aldous, Asymptotics in the random assignment problem, Probab. Theory Related Fields, 93, 507-534 (1992).
4. K. Alexander, Percolation and minimal spanning forests in infinite graphs, Ann. Probab., 23, 87-104 (1995).
5. R. Arratia, L. Goldstein, and L. Gordon, Two moments suffice for Poisson approximations: the Chen-Stein method, Ann. Probab., 17, 9-25 (1989).
6. P. Billingsley, Convergence of Probability Measures, Wiley, New York, 1968.
7. B. Bollobás, The evolution of the cube, Combinatorial Mathematics, C. Berge, D. Bresson, P. Camion, J. F. Maurras, and F. Sterboul, Eds., North-Holland, Amsterdam, 1983, pp. 91-97.
8. B. Bollobás, Random Graphs, Academic Press, London, 1985.
9. Yu. Burtin, On the problem of connectedness of a random subgraph of the n-cube, Problemy Peredachi Informatsii, 13, 90-95 (1977) (in Russian).
10. J. A. Fill and R. Pemantle, Percolation, first-passage percolation and covering times for Richardson's model on the n-cube, Ann. Appl. Probab., 3, 593-629 (1993).
11. A. M. Frieze, On the value of a random minimal spanning tree problem, Discrete Appl. Math., 10, 47-56 (1985).
12. A. M. Frieze and C. J. H. McDiarmid, On random minimum length spanning trees, Combinatorica, 9, 363-374 (1989).
13. G. Grimmett, Percolation, Springer, New York, 1989.
14. S. Janson, The minimal spanning tree in a complete graph and a functional limit-theorem for trees in a random graph, Random Struct. Alg., 7, 337-355 (1995).
15. H. Kesten and S. Lee, The central limit theorem for weighted minimal spanning trees on random points, Ann. Appl. Probab., 6, 495-527 (1996).
16. M. D. Penrose, The random minimal spanning tree in high dimensions, Ann. Probab., 24, 1903-1925 (1996).
17. R. C. Prim, Shortest connecting networks and some generalizations. Bell Syst. Tech. J., 36, 1389-1401 (1957).
18. S. I. Resnick, Extreme Values, Regular Variation, and Point Processes, Springer, New York, 1987.
19. J. M. Steele, Probability and problems in Euclidean combinatorial optimization, Statist. Sci., 8, 48-56 (1993).
20. D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic Geometry and its Applications, 1st ed., Wiley, New York, 1987, p. 105 (2nd ed., 1995, p. 110).
21. D. Stoyan, W. S. Kendall, and J. Mecke, Stochastic Geometry and its Applications, 1st ed., Wiley, New York, 1987, p. 105 (2nd ed., 1995, p. 110).