Random two-component spanning forests

From MaRDI portal



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.


The authors study random two-component spanning forests, that is subgraphs of a given finite graph \(\mathcal{G}\) in \(\mathbb{R}^d,\) containing no cycles and having two connected components. They give formulas for the size of these components, and study some properties regarding their vertices and edges.











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)