A new encoding of coalescent processes: applications to the additive and multiplicative cases

DOI10.1007/S00440-015-0665-1zbMATH Open1388.60035arXiv1409.4266OpenAlexW1747067133MaRDI QIDQ328790FDOQ328790

Authors: Nicolas Broutin, Jean-François Marckert 

Publication date: 21 October 2016

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Abstract: We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley trees or a parking scheme in the additive case, and the random graph process $(G(n,p){)}_p$ in the multiplicative case. Time being fixed, encoding these combinatorial objects in real-valued processes indexed by the line is the key to describing the asymptotic behaviour of the masses as $no+infty$. We propose to use the Prim order on the vertices instead of the classical breadth-first (or depth-first) traversal to encode the combinatorial coalescent processes. In the additive case, this yields interesting connections between the different representations of the process. In the multiplicative case, it allows one to answer to a stronger version of an open question of Aldous [Ann. Probab., vol. 25, pp. 812--854, 1997]: we prove that not only the sequence of (rescaled) masses, seen as a process indexed by the time $lambda$, converges in distribution to the reordered sequence of lengths of the excursions above the current minimum of a Brownian motion with parabolic drift $(B_t+lambdat-t^2/2,tgeq0)$, but we also construct a version of the standard augmented multiplicative coalescent of Bhamidi, Budhiraja and Wang [Probab. Theory Rel., to appear] using an additional Poisson point process.

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

Recommendations

• The eternal multiplicative coalescent encoding via excursions of Lévy-type processes
• A new combinatorial representation of the additive coalescent
• The entrance boundary of the multiplicative coalescent
• On a ternary coalescent process
• The standard additive coalescent

zbMATH Keywords

random graphPrim's algorithmCayley treeadditive coalescentinvasion percolationmultiplicative coalescent

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorics in computer science (68R05) Continuous-time Markov processes on general state spaces (60J25) Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Title not available (Why is that?)
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Random graphs.
• On a conditionally Poissonian graph process
• Random Fragmentation and Coagulation Processes
• Random trees and applications
• An invariance principle for random walk conditioned by a late return to zero
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Phase transition for Parking blocks, Brownian excursion and coalescence
• Stochastic coalescence with homogeneous-like interaction rates
• Erdős-Renyi random graphs \(+\) forest fires \(=\) self-organized criticality
• Coalescent random forests
• The standard additive coalescent
• Construction of Markovian coalescents
• A fragmentation process connected to Brownian motion
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent
• One more approach to the convergence of the empirical process to the Brownian bridge
• The continuum limit of critical random graphs
• Well-posedness of Smoluchowski's coagulation equation for a class of homogeneous kernels
• Capillary displacement and percolation in porous media
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Aggregation models with limited choice and the multiplicative coalescent
• Justification and Extension of Doob's Heuristic Approach to the Kolmogorov- Smirnov Theorems
• The continuum random tree. I

Cited In (18)

• Multidimensional Lambert-Euler inversion and vector-multiplicative coalescent processes
• A new combinatorial representation of the additive coalescent
• Rigid representations of the multiplicative coalescent with linear deletion
• Heavy-tailed configuration models at criticality
• Cross-Multiplicative Coalescent Processes and Applications
• The eternal multiplicative coalescent encoding via excursions of Lévy-type processes
• Parking on Cayley trees and frozen Erdős-Rényi
• On moments of multiplicative coalescents
• Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
• Asymptotic behaviour of the first positions of uniform parking functions
• Stochastic block model in a new critical regime and the interacting multiplicative coalescent
• Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees
• Models of random subtrees of a graph
• Coupling Bertoin's and Aldous-Pitman's representations of the additive coalescent
• Title not available (Why is that?)
• The standard additive coalescent
• Critical random forests
• Inhomogeneous continuum random trees and the entrance boundary of the additive coalescent

This page was built for publication: A new encoding of coalescent processes: applications to the additive and multiplicative cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328790)