Scaling limits of random trees and graphs
From MaRDI portal
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Functional limit theorems; invariance principles (60F17) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)
Recommendations
Cited in
(20)- Local limit of labeled trees and expected volume growth in a random quadrangulation
- A note on the scaling limits of random Pólya trees
- The CRT is the scaling limit of random dissections
- Asymptotic properties of random unlabelled block-weighted graphs
- Scaling limits for a family of unrooted trees
- Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
- The CRT is the scaling limit of unordered binary trees
- Graph limits of random unlabelled k-trees
- On large‐girth regular graphs and random processes on trees
- Scaling limits of Markov branching trees and Galton-Watson trees conditioned on the number of vertices with out-degree in a given set
- Scaling limits of random graphs from subcritical classes: extended abstract
- Scale free properties of random \(k\)-trees
- Scaling limits of random trees and random graphs
- Scaling limits of random graphs from subcritical classes
- Scaling limits of k-ary growing trees
- Scaling limits of random Pólya trees
- On the shape of random Pólya structures
- Limit laws for UGROW random graphs
- The scaling limit of lattice trees in high dimensions
- Scaling limits for simple random walks on random ordered graph trees
This page was built for publication: Scaling limits of random trees and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794867)
