Recurrence of distributional limits of finite planar graphs

Electronic Journal of Probability

Volumn 6, Issue , 2001, Pages 1-13

  Benjamini, Itai ^a   Schramm, Oded ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Circle packing; Mass trasport; Random triangulations; Random walks; Volume growth

Indexed keywords

EID: 0242278812     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v6-96     Document Type: Article

References (23)

1. Jan Ambjorn, Konstantinos N. Anagnostopoulos, Lars Jensen, Takashi Ichihara, and Yoshiyuki Watabiki. Quantum geometry and diffusion. J. High Energy Phys., (11):Paper 22, 16 pp. (electronic), 1998.
2. Jan Ambjorn, Bergfinnur Durhuus, and Thordur Jonsson. Quantum geometry. Cambridge University Press, Cambridge, 1997. A statistical field theory approach.
3. Jan Ambjorn, Jakob L. Nielsen, Juri Rolf, Dimitrij Boulatov, and Yoshiyuki Watabiki. The spectral dimension of 2D quantum gravity. J. High Energy Phys., (2):Paper 10, 8 pp. (electronic), 1998.
4. Laszlo Babai. The growth rate of vertex-transitive planar graphs. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 1997), pages 564-573, New York, 1997. ACM.
5. Marcel Berger. Les placements de cercles. Pour la Science (French Scientific American), 176, 1992.
6. I. Benjamini, R. Lyons, Y. Peres, and O. Schramm. Group-invariant percolation on graphs. Geom. Funct. Anal., 9(1):29-66, 1999.
7. I. Benjamini and O. Schramm. Harmonic functions on planar and almost planar graphs and manifolds, via circle packings. Invent. Math., 126:565-587, 1996.
8. Yves Colin de Verdiere. Une principe variationnel pour les empilements de cercles. Inventiones Mathematicae, 104:655-669, 1991.
9. Zhicheng Gao and Nicholas C. Wormald. The distribution of the maximum vertex degree in random planar maps. J. Combin. Theory Ser. A, 89(2):201-230, 2000.
10. Olle Haggstrom. Infinite clusters in dependent automorphism invariant percolation on trees. Ann. Probab., 25(3):1423-1436, 1997.
11. Zheng-Xu He and O. Schramm. Hyperbolic and parabolic packings. Discrete Comput. Geom., 14(2):123-149, 1995.
12. Johan Jonasson and Oded Schramm. On the cover time of planar graphs. Electron. Comm. Probab., 5:85-90, 2000. paper no. 10.
13. P. Koebe. Kontaktprobleme der Konformen Abbildung. Ber. Sachs. Akad. Wiss. Leipzig, Math.-Phys. Kl., 88:141-164, 1936.
14. V. A. Malyshev. Probability related to quantum gravitation: planar gravitation. Uspekhi Mat. Nauk, 54(4(328)):3-46, 1999.
15. Gareth McCaughan. A recurrence/transience result for circle packings. Proc. Amer. Math. Soc., 126(12):3647-3656, 1998.
16. S. Malitz and A. Papakostas. On the angular resolution of planar graphs. SIAM J. Discrete Math., 7:172-183, 1994.
17. Gary L. Miller and William Thurston. Separators in two and three dimensions. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 300-309. ACM, Baltimore, May 1990.
18. Burt Rodin and Dennis Sullivan. The convergence of circle packings to the Riemann mapping. J. Differential Geom., 26(2):349-360, 1987.
19. Horst Sachs. Coin graphs, polyhedra, and conformal mapping. Discrete Math., 134:133-138, 1994.
20. Gilles Schaeffer. Random sampling of large planar maps and convex polyhedra. In Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999), pages 760-769 (electronic). ACM, New York, 1999.
21. Kenneth Stephenson. Approximation of conformal structures via circle packing. In N. Papamichael, St. Ruscheweyh, and E. B. Saff, editors, Computational Methods and Function Theory 1997, Proceedings of the Third CMFT Conference, volume 11, pages 551-582. World Scientific, 1999.
22. Robin Thomas. Recent excluded minor theorems for graphs. In Surveys in combinatorics, 1999 (Canterbury), pages 201-222. Cambridge Univ. Press, Cambridge, 1999.
23. W. T. Tutte. A census of planar triangulations. Canad. J. Math., 14:21-38, 1962.