The number of double triangles in random planar maps
From MaRDI portal
Recommendations
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- Pattern occurrences in random planar maps
- Sharp concentration of the number of submaps in random planar triangulations
- Limit laws of planar maps with prescribed vertex degrees
Cites work
- A Census of Planar Maps
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- Asymptotic normality determined by high moments, and submap counts of random maps
- Local convergence of large critical multi-type Galton-Watson trees and applications to random maps
- On the Enumeration of Rooted Non-Separable Planar Maps
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Random Trees
- Uniform infinite planar triangulations
- Universal exponents and tail estimates in the enumeration of planar maps
Cited in
(8)- Asymptotic normality determined by high moments, and submap counts of random maps
- Counting embeddings of rooted trees into families of rooted trees
- Universal singular exponents in catalytic variable equations
- Local convergence of random planar graphs
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- A central limit theorem for the number of degree-\(k\) vertices in random maps
- Cut vertices in random planar maps
- Local convergence of random planar graphs
This page was built for publication: The number of double triangles in random planar maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993541)
