Rigid representations of the multiplicative coalescent with linear deletion

DOI10.1214/17-EJP100zbMath1375.60137arXiv1610.00891OpenAlexW2528001054MaRDI QIDQ2411875

Yanyan Li

Publication date: 25 October 2017

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

multiplicative coalescentErdős-Rényi random graphfrozen percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting particle systems in time-dependent statistical mechanics (82C22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Limit theorems for vector-valued random variables (infinite-dimensional case) (60B12)

Related Items (9)

A probabilistic approach to the leader problem in random graphs ⋮ Generalizations of forest fires with ignition at the origin ⋮ Parking on Cayley trees and frozen Erdős-Rényi ⋮ Feller property of the multiplicative coalescent with linear deletion ⋮ A moment-generating formula for Erdős-Rényi component sizes ⋮ Critical random forests ⋮ Stochastic block model in a new critical regime and the interacting multiplicative coalescent ⋮ The eternal multiplicative coalescent encoding via excursions of Lévy-type processes ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees

This page was built for publication: Rigid representations of the multiplicative coalescent with linear deletion