A probabilistic approach to block sizes in random maps
From MaRDI portal
Publication:4612235
zbMath1405.60014arXiv1503.08159MaRDI QIDQ4612235
Publication date: 22 January 2019
Full work available at URL: https://arxiv.org/abs/1503.08159
Enumeration in graph theory (05C30) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (9)
Limits of random tree-like discrete structures ⋮ A phase transition in block-weighted random maps ⋮ Random cubic planar maps ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ Cut vertices in random planar maps ⋮ On random trees and forests ⋮ On the maximal offspring in a subcritical branching process ⋮ Local convergence of random planar graphs ⋮ Vertices with fixed outdegrees in large Galton-Watson trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
- Conditional distribution of heavy tailed random variables on large deviations of their sum
- Large deviations for random walks under subexponentiality: The big-jump domain
- Extremes and related properties of random sequences and processes
- Une nouvelle demonstration combinatoire des formules d'inversion de Lagrange
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Limit theorems for conditioned non-generic Galton-Watson trees
- Condensation for a fixed number of independent random variables
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Random maps, coalescing saddles, singularity analysis, and Airy phenomena
- The Size of the Largest Components in Random Planar Maps
- Largest 4‐connected components of 3‐connected planar triangulations
- A Census of Planar Maps
- Enumeration of Non-Separable Planar Maps
This page was built for publication: A probabilistic approach to block sizes in random maps
