Local convergence of random planar graphs
From MaRDI portal
Publication:6604673
Cites work
- scientific article; zbMATH DE number 1146225 (Why is no real title available?)
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- A complete grammar for decomposing a family of graphs into 3-connected components
- A view from infinity of the uniform infinite planar quadrangulation
- An introduction to heavy-tailed and subexponential distributions
- Asymptotic enumeration and limit laws of planar graphs
- Degree distribution in random planar graphs
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Graphs on surfaces
- Growing random 3-connected maps or \textit{Comment s'enfuir de l'hexagone}
- Large deviations for random walks under subexponentiality: The big-jump domain
- Limits of random tree-like discrete structures
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- On random planar graphs, the number of planar graphs and their triangulations
- On the Number of Edges in Random Planar Graphs
- On the degree distribution of random planar graphs
- On the diameter of random planar graphs
- Percolation on uniform infinite planar maps
- Random planar graphs
- Recurrence of bipartite planar maps
- Recurrence of planar graph limits
- The maximum degree of random planar graphs
- The number of double triangles in random planar maps
- The number of labeled 2-connected planar graphs
- Uniform infinite planar triangulations
This page was built for publication: Local convergence of random planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604673)
