A random tree model associated with random graphs
From MaRDI portal
Publication:3970906
Recommendations
Cited in
(30)- Critical random graphs and the structure of a minimum spanning tree
- 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
- Random tree-weighted graphs
- Notes on growing a tree in a graph
- 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
- Geometry of the minimal spanning tree of a random 3-regular graph
- A random graph growth model
- The tree structure of graphs for various graphical models
- The random minimal spanning tree in high dimensions
- Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
- The \(\zeta(2)\) limit in the random assignment problem
- Random multitrees
- Strong inequalities and a branch-and-price algorithm for the convex recoloring problem
- A variant of the Erdős–Rényi random graph process
- 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
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)
