Scaling limits of random trees and random graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3951715 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 1859371 (Why is no real title available?)
- A course in metric geometry
- A critical point for random graphs with a given degree sequence
- A line-breaking construction of the stable trees
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- An invariance principle for random walk conditioned by a late return to zero
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Continuum limit of critical inhomogeneous random graphs
- Critical random graphs: limiting constructions and distributional properties
- Critical window for the configuration model: finite third moment degrees
- Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees
- Novel scaling limits for critical inhomogeneous random graphs
- Random real trees
- Random trees and applications
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- Scaling limits of random trees and planar maps
- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
- The component sizes of a critical random graph with given degree sequence
- The continuum limit of critical random graphs
- The continuum random tree. I
- The continuum random tree. III
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion
- The genealogy of self-similar fragmentations with negative index as a continuum random tree
- The phase transition in the configuration model
- The scaling limit of the minimum spanning tree of the complete graph
- The uniform random tree in a Brownian excursion
- Universality for critical heavy-tailed network models: metric structure of maximal components
Cited in
(16)- Local limit of labeled trees and expected volume growth in a random quadrangulation
- A note on the scaling limits of random Pólya trees
- Scaling limits for a family of unrooted trees
- Scaling limits of random trees and graphs
- Scaling limit for the random walk on the largest connected component of the critical random graph
- Graph limits of random unlabelled k-trees
- Random walks on decorated Galton-Watson trees
- On large‐girth regular graphs and random processes on trees
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
- Scale free properties of random \(k\)-trees
- On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
- Scaling limits of k-ary growing trees
- Limit laws for UGROW random graphs
- Growing random graphs with a preferential attachment structure
- The scaling limit of lattice trees in high dimensions
This page was built for publication: Scaling limits of random trees and random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3294677)