Published October 2017
| Submitted + Published
Journal Article
Open
Boundaries of planar graphs: a unified approach
- Creators
- Hutchcroft, Tom
- Peres, Yuval
Abstract
We give a new proof that the Poisson boundary of a planar graph coincides with the boundary of its square tiling and with the boundary of its circle packing, originally proven by Georgakopoulos [9] and Angel, Barlow, Gurel-Gurevich and Nachmias [2] respectively. Our proof is robust, and also allows us to identify the Poisson boundaries of graphs that are rough-isometric to planar graphs. We also prove that the boundary of the square tiling of a bounded degree plane triangulation coincides with its Martin boundary. This is done by comparing the square tiling of the triangulation with its circle packing.
Additional Information
© 2017 The Author(s). Creative Commons Attribution 4.0 International License. Submitted to EJP on August 13, 2016, final version accepted on October 9, 2017. This work was carried out while TH was an intern at Microsoft Research, Redmond. We thank Russ Lyons and Asaf Nachmias for helpful discussions, and thank the anonymous referee for their careful reading of the paper. We thank Itai Benjamini for granting us permission to include the square tiling of Figure 1, which originally appeared in [5]. The circle packing in Figure 1 was created using Ken Stephenson's CirclePack software.Attached Files
Published - 17-EJP116.pdf
Submitted - 1508.03923.pdf
Files
17-EJP116.pdf
Files
(1.2 MB)
Name | Size | Download all |
---|---|---|
md5:b540d2f6f087e78570d39e7ae9b582a2
|
524.5 kB | Preview Download |
md5:3c506dc3b0826fd579a99e15768d5e1c
|
661.3 kB | Preview Download |
Additional details
- Eprint ID
- 111023
- Resolver ID
- CaltechAUTHORS:20210924-183504452
- Microsoft Research
- Created
-
2021-09-27Created from EPrint's datestamp field
- Updated
-
2021-09-27Created from EPrint's last_modified field