A random tree model associated with random graphs

DOI10.1002/RSA.3240010402zbMATH Open0747.05077OpenAlexW2009489698MaRDI QIDQ3970906FDOQ3970906

Authors: David Aldous 

Publication date: 25 June 1992

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240010402

Recommendations

• The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
• On finding a minimum spanning tree in a network with random weights
• Random trees and general branching processes
• Tree and forest weights and their application to nonuniform random graphs

zbMATH Keywords

random graphrandom tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Cited In (30)

• Random trees and general branching processes
• Partition functions of discrete coalescents: from Cayley's formula to Frieze's \(\zeta (3)\) limit theorem
• Components of Random Forests
• Linking and cutting spanning trees
• Gaussian tail for empirical distributions of MST on random graphs
• On the multivariate runs test
• Notes on growing a tree in a graph
• Random tree-weighted graphs
• Note on the structure of Kruskal's algorithm
• Some probabilistic trees with algebraic roots
• Asymptotics for Euclidean minimal spanning trees on random points
• Tail bound for the minimal spanning tree of a complete graph.
• Generating infinite random graphs
• Asymptotics in the random assignment problem
• Local/Global Phenomena in Geometrically Generated Graphs
• A random graph growth model
• Geometry of the minimal spanning tree of a random 3-regular graph
• The tree structure of graphs for various graphical models
• Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
• The random minimal spanning tree in high dimensions
• The \(\zeta(2)\) limit in the random assignment problem
• Random multitrees
• A variant of the Erdős–Rényi random graph process
• Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
• Tree-based models for random distribution of mass
• Coalescent random forests
• Phase transition phenomena in random discrete structures
• Random multi-index matching problems
• On finding a minimum spanning tree in a network with random weights
• Critical random graphs and the structure of a minimum spanning tree

This page was built for publication: A random tree model associated with random graphs

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