Critical random forests

zbMATH Open1393.05241arXiv1709.07514MaRDI QIDQ4580338FDOQ4580338

Author name not available (Why is that?)

Publication date: 15 August 2018

Abstract: Let $F(N,m)$ denote a random forest on a set of $N$ vertices, chosen uniformly from all forests with $m$ edges. Let $F(N,p)$ denote the forest obtained by conditioning the Erdos-Renyi graph $G(N,p)$ to be acyclic. We describe scaling limits for the largest components of $F(N,p)$ and $F(N,m)$, in the critical window $p=N^{-1}+O(N^{-4/3})$ or $m=N/2+O(N^{2/3})$. Aldous described a scaling limit for the largest components of $G(N,p)$ 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.

Full work available at URL: https://arxiv.org/abs/1709.07514

zbMATH Keywords

random graphrandom forestcritical windowexploration process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• Random graphs and complex networks. Volume 1
• Two critical periods in the evolution of random planar graphs
• Diffusion processes with boundary conditions
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The entrance boundary of the multiplicative coalescent
• Multidimensional diffusion processes.
• Title not available (Why is that?)
• The Existence of Probability Measures with Given Marginals
• Novel scaling limits for critical inhomogeneous random graphs
• Component behavior near the critical point of the random graph process
• Title not available (Why is that?)
• Title not available (Why is that?)
• The phase transition in the configuration model
• Random trees and applications
• An invariance principle for random walk conditioned by a late return to zero
• The continuum limit of critical random graphs
• A new encoding of coalescent processes: applications to the additive and multiplicative cases
• The Evolution of Random Graphs
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• Title not available (Why is that?)
• Critical random graphs: limiting constructions and distributional properties
• Components of Random Forests
• Diffusion approximation for the components in critical inhomogeneous random graphs of rank 1.
• The component sizes of a critical random graph with given degree sequence
• Critical window for the configuration model: finite third moment degrees
• Continuum limit of critical inhomogeneous random graphs
• Rigid representations of the multiplicative coalescent with linear deletion
• A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
• Asymptotics of the number of forests consisting of unrooted trees

Cited In (8)

• Percolation transition for random forests in \(d \geqslant 3\)
• The wired arboreal gas on regular trees
• Random spanning forests and hyperbolic symmetry
• Parking on Cayley trees and frozen Erdős-Rényi
• Spin systems with hyperbolic symmetry: a survey
• Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022
• Uniqueness of the infinite tree in low-dimensional random forests
• Forests on wired regular trees

   Recommendations

• Title not available (Why is that?) 👍 👎
• Random forests 👍 👎
• Title not available (Why is that?) 👍 👎
• Random recursive forests 👍 👎
• Generalized random forests 👍 👎
• On the asymptotics of random forests 👍 👎
• Random survival forests 👍 👎
• Title not available (Why is that?) 👍 👎

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)