Percolation in Voronoi tilings

Random Structures and Algorithms

Volumn 26, Issue 3, 2005, Pages 310-318

  Balister, P ^a   Bollobas B ^a,b   Quas, A ^a  

^a University of Memphis   (United States)

^b TRINITY COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22144437365     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20043     Document Type: Article

References (6)

1. P. Balister, B. Bollobás, and A. Stacey, Improved upper bounds for the critical probability of oriented percolation in two dimensions, Random Structures Algorithm, 4 (1994), 573-589.
2. I. Benjamini and O. Schramm, Percolation in the hyperbolic plane, J Amer Math Soc 14(2) (2001), 487-507.
3. M. H. Freedman, Percolation on the projective plane, Math Res Lett 4(6) (1997), 889-894.
4. M. D. Penrose, On k-connectivity for a geometric random graph, Random Structures Algorithms 15(2) (1999), 145-164.
5. M. Q. Vahidi-Asl and J. C. Wierman, "First-passage percolation on the Voronoǐ tessellation and Delaunay triangulation," Random graphs '87 (Poznán, 1987), A. Frieze and T. Kuczak (Editors), Wiley, Chichester, 1990, pp. 341-359.
6. M. Q. Vahidi-Asl and J. C. Wierman, Upper and lower bounds for the route length of first-passage percolation in Voronoǐ tessellations, Bull Iranian Math Soc 19(1) (1993), 15-28.