Percolation for the stable marriage of Poisson and Lebesgue
classification
🧮 math.PR
keywords
alphapercolationclaimedenoughmarriagepoissonsitesstable
read the original abstract
Let $\Xi$ be the set of points (we call the elements of $\Xi$ centers) of Poisson process in $\R^d$, $d\geq 2$, with unit intensity. Consider the allocation of $\R^d$ to $\Xi$ which is stable in the sense of Gale-Shapley marriage problem and in which each center claims a region of volume $\alpha\leq 1$. We prove that there is no percolation in the set of claimed sites if $\alpha$ is small enough, and that, for high dimensions, there is percolation in the set of claimed sites if $\alpha<1$ is large enough.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.