Local convergence of random planar graphs
From MaRDI portal
Publication:6604673
DOI10.1007/978-3-030-83823-2_10MaRDI QIDQ6604673FDOQ6604673
Authors: Benedikt Stufler 
Publication date: 13 September 2024
Cites Work
- A complete grammar for decomposing a family of graphs into 3-connected components
- Uniform infinite planar triangulations
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- Recurrence of bipartite planar maps
- Graph classes with given 3-connected components: asymptotic enumeration and random graphs
- Asymptotic enumeration and limit laws of planar graphs
- Percolation on uniform infinite planar maps
- Recurrence of planar graph limits
- Graphs on surfaces
- An introduction to heavy-tailed and subexponential distributions
- The maximum degree of random planar graphs
- Degree distribution in random planar graphs
- Random planar graphs
- Growing random 3-connected maps or \textit{Comment s'enfuir de l'hexagone}
- On random planar graphs, the number of planar graphs and their triangulations
- The number of labeled 2-connected planar graphs
- A view from infinity of the uniform infinite planar quadrangulation
- Title not available (Why is that?)
- Large deviations for random walks under subexponentiality: The big-jump domain
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- On the degree distribution of random planar graphs
- On the Number of Edges in Random Planar Graphs
- On the diameter of random planar graphs
- Limits of random tree-like discrete structures
- The number of double triangles in random planar maps
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)
