Critical random forests
From MaRDI portal
Publication:4580338
Abstract: Let denote a random forest on a set of vertices, chosen uniformly from all forests with edges. Let denote the forest obtained by conditioning the Erdos-Renyi graph to be acyclic. We describe scaling limits for the largest components of and , in the critical window or . Aldous described a scaling limit for the largest components of within the critical window in terms of the excursion lengths of a reflected Brownian motion with time-dependent drift. Our scaling limit for critical random forests is of a similar nature, but now based on a reflected diffusion whose drift depends on space as well as on time.
Recommendations
Cites work
- scientific article; zbMATH DE number 3828921 (Why is no real title available?)
- scientific article; zbMATH DE number 19286 (Why is no real title available?)
- scientific article; zbMATH DE number 48952 (Why is no real title available?)
- scientific article; zbMATH DE number 3198427 (Why is no real title available?)
- A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
- A new encoding of coalescent processes: applications to the additive and multiplicative cases
- An invariance principle for random walk conditioned by a late return to zero
- Asymptotics of the number of forests consisting of unrooted trees
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Component behavior near the critical point of the random graph process
- Components of Random Forests
- Continuum limit of critical inhomogeneous random graphs
- Critical random graphs: limiting constructions and distributional properties
- Critical window for the configuration model: finite third moment degrees
- Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
- Diffusion processes with boundary conditions
- Multidimensional diffusion processes.
- Novel scaling limits for critical inhomogeneous random graphs
- Random graphs and complex networks. Volume 1
- Random trees and applications
- Rigid representations of the multiplicative coalescent with linear deletion
- Scaling limits for critical inhomogeneous random graphs with finite third moments
- The Evolution of Random Graphs
- The Existence of Probability Measures with Given Marginals
- The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
- The component sizes of a critical random graph with given degree sequence
- The continuum limit of critical random graphs
- The entrance boundary of the multiplicative coalescent
- The phase transition in the configuration model
- Two critical periods in the evolution of random planar graphs
Cited in
(11)- Scaling limits of random trees and random graphs
- Parking on Cayley trees and frozen Erdős-Rényi
- Scaling limit of random forests with prescribed degree sequences
- Percolation transition for random forests in \(d \geqslant 3\)
- Random spanning forests and hyperbolic symmetry
- Spin systems with hyperbolic symmetry: a survey
- The wired arboreal gas on regular trees
- Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
- Forests on wired regular trees
- Small trees in supercritical random forests
- Uniqueness of the infinite tree in low-dimensional random forests
This page was built for publication: Critical random forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580338)