The expected degree of minimal spanning forests

DOI10.1007/S00493-014-3160-XzbMath1399.05157arXiv1306.0303OpenAlexW2964086399WikidataQ61677643 ScholiaQ61677643MaRDI QIDQ5915869

Andreas Thom

Publication date: 22 February 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

spectral radiustransitive graphminimal spanning forest

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Algebraic ergodic theory, cocycles, orbit equivalence, ergodic equivalence relations (37A20) Vertex degrees (05C07) Probability theory on algebraic and topological structures (60B99)

Related Items (1)

Percolation on hyperbolic graphs

Cites Work

• A measurable-group-theoretic solution to von Neumann's problem
• Minimal spanning forests
• Ergodic subequivalence relations induced by a Bernoulli action
• The Dixmier problem, lamplighters and Burnside groups
• \(\ell^2\) invariants of equivalence relations and groups
• Topics in orbit equivalence
• Cost of equivalence relations and groups
• Normal generation and \(\ell^2\)-Betti numbers of groups.
• Ends in free minimal spanning forests
• Symmetric Random Walks on Groups
• Nonunitarizable Representations and Random Forests
• Bernoulli actions are weakly contained in any free action
• Random Walks on Infinite Graphs and Groups
• On non-uniqueness of percolation on nonamenable Cayley graphs

This page was built for publication: The expected degree of minimal spanning forests