2000 character limit reached
Boundaries of Planar Graphs: A Unified Approach
Published 17 Aug 2015 in math.PR | (1508.03923v2)
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 and Angel, Barlow, Gurel-Gurevich and Nachmias 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.