Annales de l'Institut Henri Poincaré, Probabilités et Statistiques

Random two-component spanning forests

Adrien Kassel, Richard Kenyon, and Wei Wu

Full-text: Open access

Abstract

We study random two-component spanning forests ($2$SF) 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 $\mathbb{R}^{d}$.

Résumé

Nous étudions la mesure uniforme sur les forêts couvrantes à deux composantes connexes d’un graphe fini et donnons des formules pour les deux premiers moments de la taille des composantes, les probabilités d’inclusion d’un ou deux sommets dans la même composante, et la probabilité qu’une arête sépare les composantes. Nous calculons la limite des ces quantités lorsque l’on considère une suite de graphes finis qui tend vers un graphe infini périodique dans $\mathbb{R}^{d}$.

Article information

Source
Ann. Inst. H. Poincaré Probab. Statist., Volume 51, Number 4 (2015), 1457-1464.

Dates
Received: 26 September 2013
Revised: 21 April 2014
Accepted: 27 April 2014
First available in Project Euclid: 21 October 2015

Permanent link to this document
https://projecteuclid.org/euclid.aihp/1445432048

Digital Object Identifier
doi:10.1214/14-AIHP625

Mathematical Reviews number (MathSciNet)
MR3414453

Zentralblatt MATH identifier
1334.82011

Subjects
Primary: 82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs 05C81: Random walks on graphs

Keywords
Two-component spanning forests Mean resistance Torsional rigidity

Citation

Kassel, Adrien; Kenyon, Richard; Wu, Wei. Random two-component spanning forests. Ann. Inst. H. Poincaré Probab. Statist. 51 (2015), no. 4, 1457--1464. doi:10.1214/14-AIHP625. https://projecteuclid.org/euclid.aihp/1445432048


Export citation

References

  • [1] I. Benjamini, R. Lyons, Y. Peres and O. Schramm. Uniform spanning forests. Ann. Probab. 29 (2001) 1–65.
  • [2] R. Burton and R. Pemantle. Local characteristics, entropy, and limit theorems for spanning trees and domino tilings via transfer impedances. Ann. Probab. 21 (3) (1993) 1329–1371.
  • [3] P. G. Doyle and J. L. Snell. Random Walks and Electric Networks. Carus Mathematical Monographs 22. Mathematical Association of America, Washington, DC, 1984.
  • [4] E. V. Ivashkevich, D. V. Ktitarev and V. B. Priezzhev. Waves of topplings in an Abelian sandpile. Phys. A 209 (1994) 347–360.
  • [5] A. Kassel and R. Kenyon. Random curves on surfaces induced by the Laplacian determinant. Preprint, 2012. Available at arXiv:1211.6974.
  • [6] A. Kassel and D. B. Wilson. The looping rate and sandpile density of planar graphs. Preprint, 2014. Available at arXiv:1402.4169.
  • [7] R. W. Kenyon and D. B. Wilson. Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on $\mathbb{Z}^{2}$. Preprint, 2011. Available at arXiv:1107.3377.
  • [8] G. Kirchhoff. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem. 72 (1847) 497–508.
  • [9] G. F. Lawler and V. Limic. Random Walk: A Modern Introduction. Cambridge Studies in Advanced Mathematics 123. Cambridge Univ. Press, Cambridge, 2010.
  • [10] L. Levine and Y. Peres. The looping constant of $\mathbb{Z}^{d}$. Random Structures Algorithms 45 (2014) 1–13.
  • [11] W. Myrvold. Counting $k$-component forests of a graph. Networks 22 (7) (1992) 647–652.
  • [12] G. Pólya. Torsional rigidity, principal frequency, electrostatic capacity, and symmetrization. Quart. Appl. Math. 6 (1948) 267–277.
  • [13] D. B. Wilson. Generating random spanning trees more quickly than the cover time. In Proceedings of the Twenty-Eigth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996) 296–303. ACM, New York, 1996.