Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component

DOI10.1017/S0963548308009188zbMath1160.05336arXiv0711.1893OpenAlexW2166982528MaRDI QIDQ3529512

Russell Lyons, Oded Schramm, Ron Peled

Publication date: 13 October 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

random graphnumber of spanning treesgiant componentPoisson offspring distributionGalton-Warson treePGW

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items (13)

A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters ⋮ Stochastic ordering of infinite geometric Galton-Watson trees ⋮ Resistance distance distribution in large sparse random graphs ⋮ New method for counting the number of spanning trees in a two-tree network ⋮ An iteration method for computing the total number of spanning trees and its applications in graph theory ⋮ Random matrices with row constraints and eigenvalue distributions of graph Laplacians ⋮ Comparing Graphs of Different Sizes ⋮ Identities and Inequalities for Tree Entropy ⋮ Enumeration of spanning trees in planar unclustered networks ⋮ Parking on a Random Tree ⋮ Volume Bounds for the Phase-Locking Region in the Kuramoto Model with Asymmetric Coupling ⋮ Topological properties of a 3-regular small world network ⋮ Counting spanning trees in self-similar networks by evaluating determinants

Cites Work

• Tree-valued Markov chains derived from Galton-Watson processes
• Functional central limit theorem for a random walk in a random environment
• The incipient infinite cluster for high-dimensional unoriented percolation
• Building uniformly random subtrees
• Asymptotic Enumeration of Spanning Trees

This page was built for publication: Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component