Critical random graphs and the structure of a minimum spanning tree
From MaRDI portal
Recommendations
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
- A random tree model associated with random graphs
- Branching processes in the analysis of the heights of trees
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Component behavior near the critical point of the random graph process
- scientific article; zbMATH DE number 986986 (Why is no real title available?)
- scientific article; zbMATH DE number 1380601 (Why is no real title available?)
- scientific article; zbMATH DE number 798854 (Why is no real title available?)
- Note on the heights of random recursive trees and random m‐ary search trees
- On random minimum length spanning trees
- On the height of trees
- On the History of the Minimum Spanning Tree Problem
- On the largest component of the random graph at a nearcritical stage
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the value of a random minimum spanning tree problem
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
- The average height of binary trees and other simple trees
- The birth of the giant component
- The diameter of sparse random graphs
- The Distribution of Heights of Binary Trees and Other Simple Trees
- The Evolution of Random Graphs
- The Structure of a Random Graph at the Point of the Phase Transition
Cited in
(26)- Geometry of minimum spanning trees on scale-free networks
- The scaling limit of the minimum spanning tree of the complete graph
- Minimum spanning trees of random geometric graphs with location dependent weights
- Geometry of the minimal spanning tree of a random 3-regular graph
- On minimum leaf spanning trees and a criticality notion
- GHS algorithm on a graph with random weights
- The continuum limit of critical random graphs
- Critical behaviour of spanning forests on random planar graphs
- scientific article; zbMATH DE number 1123759 (Why is no real title available?)
- On the Critical Value for ‘Percolation’ of Minimum-Weight Trees in the Mean-Field Distance Model
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
- Probability on a complete graph: uniform and minimal spanning trees
- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
- Partition functions of discrete coalescents: from Cayley's formula to Frieze's (3) limit theorem
- Aggregation models with limited choice and the multiplicative coalescent
- Approximating the statistics of various properties in randomly weighted graphs
- Diameter of the stochastic mean-field model of distance
- Maximal Steiner trees in the stochastic mean-field model of distance
- The diameter of the uniform spanning tree of dense graphs
- Successive minimum spanning trees
- Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
- Average update times for fully-dynamic all-pairs shortest paths
- The wired minimal spanning forest on the Poisson-weighted infinite tree
- Continuum limit of critical inhomogeneous random graphs
- On the minimum spanning tree distribution in grids
- Models of random spanning trees
This page was built for publication: Critical random graphs and the structure of a minimum spanning tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055778)
