Poisson allocations with bounded connected cells

DOI10.1214/ECP.V20-3853MaRDI QIDQ894495zbMATH OpenOpenAlexFDO

Authors A. E. Holroyd, James Martin

Publication date 1 December 2015

Published in Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

Poisson processallocation

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Geometric probability and stochastic geometry (60D05) Stationary stochastic processes (60G10)

Abstract: Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with each point of the process contained in exactly one cell. Moreover, the diameter $D$ of the cell containing the origin satisfies the essentially optimal tail bound $P(D>r)<c/r$. We give two variants of the construction. The first has the curious property that any two cells are at positive distance from each other. In the second, any bounded region of the plane intersects only finitely many cells almost surely.

Recommendations

• A Poisson allocation of optimal tail
• Gravitational allocation to Poisson points
• Connected allocation to Poisson points in \(\mathbb R^{2}\)
• Poissonian tessellations of the Euclidean space. An extension of a result of R. E. Miles
• Poisson splitting by factors

Cited in

(4)

• Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions
• Gravitational allocation to Poisson points
• Connected allocation to Poisson points in \(\mathbb R^{2}\)
• Poisson splitting by factors

This page was built for publication: Poisson allocations with bounded connected cells

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