UNIFORM SPANNING FORESTS OF PLANAR GRAPHS
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 spa...
Main Authors: | TOM HUTCHCROFT, ASAF NACHMIAS |
---|---|
Format: | Article |
Language: | English |
Published: |
Cambridge University Press
2019-01-01
|
Series: | Forum of Mathematics, Sigma |
Subjects: | |
Online Access: | https://www.cambridge.org/core/product/identifier/S2050509419000148/type/journal_article |
Similar Items
-
ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE
by: ITAI BENJAMINI, et al.
Published: (2016-01-01) -
Span of a Graph: Keeping the Safety Distance
by: Iztok Banič, et al.
Published: (2023-03-01) -
Two-Point Concentration of the Independence Number of the Random Graph
by: Tom Bohman, et al.
Published: (2024-01-01) -
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs
by: Stefan Felsner, et al.
Published: (2017-02-01) -
FINITELY DEPENDENT COLORING
by: ALEXANDER E. HOLROYD, et al.
Published: (2016-01-01)