A new combinatorial representation of the additive coalescent

DOI10.1002/rsa.20775zbMath1409.05103OpenAlexW2564399637WikidataQ130028121 ScholiaQ130028121MaRDI QIDQ4633321

Minmin Wang, Jean-François Marckert

Publication date: 2 May 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: http://sro.sussex.ac.uk/id/eprint/81913/1/coalescence.pdf

zbMATH Keywords

parkingincreasing treesadditive coalescentrandom walks on treesCayley trees

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Random walks on graphs (05C81)

Related Items (4)

Exact combinatorial approach to finite coagulating systems through recursive equations ⋮ Models of random subtrees of a graph ⋮ A geometric representation of fragmentation processes on stable trees ⋮ Combinatorial solutions to coagulation kernel for linear chains

Cites Work

• A new encoding of coalescent processes: applications to the additive and multiplicative cases
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• Cutting down trees with a Markov chainsaw
• The continuum random tree. I
• The coalescent
• 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
• Coalescent random forests
• The standard additive coalescent
• The uniform random tree in a Brownian excursion
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Construction of Markovian coalescents
• A fragmentation process connected to Brownian motion
• Fires on trees
• The vertex-cut-tree of Galton-Watson trees converging to a stable tree
• Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
• Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
• Well-posedness of Smoluchowski's coagulation equation for a class of homogeneous kernels
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• On the maximum degree in a random tree
• A problem of arrangements
• Phase transition for Parking blocks, Brownian excursion and coalescence
• Random cutting and records in deterministic and random trees
• Cutting down very simple trees
• Random Fragmentation and Coagulation Processes
• Forests of labeled trees
• Cutting down random trees

This page was built for publication: A new combinatorial representation of the additive coalescent