Random two-component spanning forests

DOI10.1214/14-AIHP625MaRDI QIDQ902877zbMATH OpenFDO

Authors Adrien Kassel, Wei Wu, Richard Kenyon

Publication date 4 January 2016

Published in Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.4858, https://projecteuclid.org/euclid.aihp/1445432048

zbMATH Keywords

torsional rigidityMean resistancetwo-component spanning forests

Mathematics Subject Classification ID

Random walks on graphs (05C81) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We study random two-component spanning forests ($2$SFs) of finite graphs, giving formulas for the first and second moments of the sizes of the components, vertex-inclusion probabilities for one or two vertices, and the probability that an edge separates the components. We compute the limit of these quantities when the graph tends to an infinite periodic graph in ${mathbbR}^d$.

Recommendations

• scientific article; zbMATH DE number 1195780
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Minimal spanning forests
• scientific article; zbMATH DE number 953290
• Components of Random Forests

Cites work

• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• Boundary partitions in trees and dimers
• Countingk-component forests of a graph
• Critical exponents for boundary avalanches in two-dimensional Abelian sandpile
• Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances
• Random curves on surfaces induced from the Laplacian determinant
• Random walk: A modern introduction
• The looping constant of \(\mathbb Z^d\)
• The looping rate and sandpile density of planar graphs
• Torsional rigidity, principal frequency, electrostatic capacity and symmetrization
• Uniform spanning forests

Cited in

(11)

• Loop-erased partitioning of a graph: mean-field analysis
• Indistinguishability of the components of random spanning forests
• A forest building process on simple graphs
• Random spanning forests and hyperbolic symmetry
• Two applications of random spanning forests
• Transfer current and pattern fields in spanning trees
• Comparing graphs of different sizes
• Learning about critical phenomena from scribbles and sandpiles
• Fundamental constants in the theory of two-dimensional uniform spanning trees
• scientific article; zbMATH DE number 3989380 (Why is no real title available?)
• Random directed forest and the Brownian web

This page was built for publication: Random two-component spanning forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902877)