Rigid representations of the multiplicative coalescent with linear deletion
James B. Martin, Balazs Rath

TL;DR
This paper introduces the multiplicative coalescent with linear deletion, a Markov process modeling block merging and deletion, with novel representations connecting to random functions and applications in self-organized criticality models.
Contribution
It extends the classical coalescent model by incorporating linear deletion and provides new rigid representations involving tilt and shift mechanisms.
Findings
Generalizes previous coalescent models without deletion.
Introduces a novel tilt-and-shift representation for the process.
Connects the process to models like forest-fire and frozen-percolation.
Abstract
We introduce the multiplicative coalescent with linear deletion, a continuous-time Markov process describing the evolution of a collection of blocks. Any two blocks of sizes and merge at rate , and any block of size is deleted with rate (where is a fixed parameter). This process arises for example in connection with a variety of random-graph models which exhibit self-organised criticality. We focus on results describing states of the process in terms of collections of excursion lengths of random functions. For the case (the coalescent without deletion) we revisit and generalise previous works by authors including Aldous, Limic, Armendariz, Uribe Bravo, and Broutin and Marckert, in which the coalescence is related to a "tilt" of a random function, which increases with time; for we find a novel representation in which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
