Math-1703 · mathematics · Probability

Math-1703

Percolation of planar empires at unit merger rate

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Start with a locally finite partition of $\mathbb R^2$ into polygonal cells, using one of the source's initial models: a regular square, triangular, or hexagonal tessellation, or the Voronoi tessellation of a homogeneous planar Poisson point process. In the last case the points form a random locally finite set with independent Poisson counts in disjoint bounded regions.

Call current regions empires. Two empires are adjacent if their boundaries share a segment of positive length, rather than only a point. In continuous time, every unordered adjacent pair merges into its union at rate one. Equivalently, conditional on the current configuration, an adjacent pair has probability $dt+o(dt)$ of merging during a short interval of length $dt$; after mergers, rates are assigned to the newly adjacent pairs.

Does this process percolate: is there a finite time at which an unbounded empire exists? Determine the answer for the indicated initial tessellations, in particular the deterministic square grid.

The rate is per pair of empires, independently of their areas, perimeters, and the number of original cell edges along their common boundary. Thus many shared boundary segments do not multiply that pair's merger rate. Empires can become nonconvex and may acquire holes; connectedness is preserved by each merger.

The target concerns formation at finite time of a region containing infinitely many original cells. It is not enough that bounded empires grow without bound as time tends to infinity. In an infinite-volume construction, possible emergence of such a region is precisely the percolation event under study.

Short English statement

Do planar regions merging at rate one per adjacent pair form an unbounded empire in finite time?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.