Random two-component spanning forests

From MaRDI portal
Publication:902877

DOI10.1214/14-AIHP625zbMATH Open1334.82011arXiv1203.4858MaRDI QIDQ902877FDOQ902877


Authors: Adrien Kassel, Wei Wu, Richard Kenyon Edit this on Wikidata


Publication date: 4 January 2016

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

Abstract: We study random two-component spanning forests (2SFs) 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 mathbbRd.


Full work available at URL: https://arxiv.org/abs/1203.4858




Recommendations




Cites Work


Cited In (6)





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)