Coalescence on the real line

DOI10.1090/TRAN/7391MaRDI QIDQ4644942zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Bhargav P. Narayanan, Paul Balister, Jonathan Lee

Publication date 9 January 2019

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

geometrically constrained coalescencespin systems

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Coalescent processes (60J90) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $mathbb{P}_R$ and $mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and blue intervals so that the lengths of the red intervals have distribution $mathbb{P}_R$, the lengths of the blue intervals have distribution $mathbb{P}_B$, and distinct intervals have independent lengths. Now, iteratively update this colouring of the line by coalescing intervals: change the colour of any interval that is surrounded by longer intervals so that these three consecutive intervals subsequently form a single monochromatic interval. We say that a colour (either red or blue) wins if every point of the line is eventually of that colour. Holroyd, in 2011, asked the following question: under what natural conditions on the initial distributions is one of the colours almost surely guaranteed to win? It turns out that the answer to this question can be quite counter-intuitive due to the non-monotone dynamics of the model. In this paper, we investigate various notions of advantage one of the colours might initially possess, and in the course of doing so, we determine which of the two colours emerges victorious for various nontrivial pairs of distributions.

Recommendations

• Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions
• On the one dimensional ``learning from neighbours model
• An oriented competition model on \(Z_{+}^{2}\)
• scientific article
• Expected coalescence time for a nonuniform allocation process

Cites work

• Aging through hierarchical coalescence in the East model
• Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains
• College Admissions and the Stability of Marriage
• Continuum percolation with steps in the square or the disc
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Every finite distributive lattice is a set of stable matchings
• Geometric properties of Poisson matchings
• scientific article; zbMATH DE number 958014 (Why is no real title available?)
• On optimal matchings
• On the absolute constants in the Berry-Esseen-type inequalities
• Poisson matching
• Random stable matchings
• The ``stable roommates problem with random preferences
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Universality for one-dimensional hierarchical coalescence processes with double and triple merges
• Universality in one-dimensional hierarchical coalescence processes
• Weighted random popular matchings

Cited in

(1)

• Why Solovay real produces Cohen real

This page was built for publication: Coalescence on the real line

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