scientific article; zbMATH DE number 3711987

MaRDI QIDQ3903022zbMATH OpenFDO

Authors G. R. Grimmett

Publication date 1980

zbMATH Keywords

branching processrandom graphrandom rooted labelled treerandom tree

Mathematics Subject Classification ID

Trees (05C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cited in

(24)

• On the structure of random unlabelled acyclic graphs.
• The local limit of the uniform spanning tree on dense graphs
• Phase transition in inhomogenous Erdős-Rényi random graphs via tree counting
• The local limit of uniform spanning trees
• Loop-erased partitioning of a graph: mean-field analysis
• Local weak convergence for PageRank
• Resolvent of large random graphs
• On the phase transition in random simplicial complexes
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• Invasion percolation on the Poisson-weighted infinite tree
• A review of random graphs
• The local weak limit of \(k\)-dimensional hypertrees
• Parking on a random tree
• Accessibility percolation on random rooted labeled trees
• Graph limits of random graphs from a subset of connected k-trees
• The Moran forest
• The scaling limit of a critical random directed graph
• Greedy maximal independent sets via local limits
• Random minimum spanning tree and dense graph limits
• Massive spanning forests on the complete graph: exact distribution and local limit
• Local limit of the random degree constrained process
• Independent sets of random trees and sparse random graphs
• Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees
• Spectra of large random trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3903022)