Scaling limit of random forests with prescribed degree sequences
From MaRDI portal
Publication:2325329
DOI10.3150/18-BEJ1058zbMath1431.62263arXiv1704.02064MaRDI QIDQ2325329
Publication date: 25 September 2019
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.02064
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Brownian motion (60J65) Functional limit theorems; invariance principles (60F17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
- Critical random graphs: limiting constructions and distributional properties
- Scaling limits for random quadrangulations of positive genus
- Invariance principles for spatial multitype Galton-Watson trees
- The continuum random tree. I
- Random trees and applications
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- The standard additive coalescent
- Path transformations of first passage bridges
- Scaling limit of random planar quadrangulations with a boundary
- Scaling limits of random planar maps with a unique large face
- The continuum random tree. III
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Phase transition for Parking blocks, Brownian excursion and coalescence
- Tail bounds for the height and width of a random tree with a given degree sequence
- The CRT is the scaling limit of unordered binary trees
- Asymptotics of trees with a prescribed degree sequence and applications