Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T18:09:43.476Z Has data issue: false hasContentIssue false

UNIFORM SPANNING FORESTS OF PLANAR GRAPHS

Published online by Cambridge University Press:  13 September 2019

TOM HUTCHCROFT
Affiliation:
Statslab, DPMMS, University of Cambridge, Cambridge CB3 0WB, UK; t.hutchcroft@maths.cam.ac.uk
ASAF NACHMIAS
Affiliation:
Department of Mathematical Sciences, Tel Aviv University, Tel Aviv 6997801, Israel; asafnach@tauex.tau.ac.il

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the critical exponents governing the geometry of the uniform spanning forests of transient proper plane graphs with bounded degrees and codegrees. We find that the same exponents hold universally over this entire class of graphs provided that measurements are made using the hyperbolic geometry of their circle packings rather than their usual combinatorial geometry.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2019