A random tree model associated with random graphs
From MaRDI portal
Publication:3970906
DOI10.1002/rsa.3240010402zbMath0747.05077OpenAlexW2009489698MaRDI QIDQ3970906
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
Related Items (21)
Partition Functions of Discrete Coalescents: From Cayley’s Formula to Frieze’s ζ(3) Limit Theorem ⋮ Phase transition phenomena in random discrete structures ⋮ Note on the structure of Kruskal's algorithm ⋮ Components of Random Forests ⋮ Strong inequalities and a branch-and-price algorithm for the convex recoloring problem ⋮ A variant of the Erdős–Rényi random graph process ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Tail bound for the minimal spanning tree of a complete graph. ⋮ The random minimal spanning tree in high dimensions ⋮ The ?(2) limit in the random assignment problem ⋮ Asymptotics for Euclidean minimal spanning trees on random points ⋮ Asymptotics in the random assignment problem ⋮ Tree-based models for random distribution of mass ⋮ Critical random graphs and the structure of a minimum spanning tree ⋮ On finding a minimum spanning tree in a network with random weights ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ On the multivariate runs test ⋮ Random multi-index matching problems ⋮ Coalescent random forests ⋮ Linking and cutting spanning trees ⋮ Gaussian tail for empirical distributions of MST on random graphs
This page was built for publication: A random tree model associated with random graphs
