Nonamenable Poisson zoo
G\'abor Pete, S\'andor Rokob

TL;DR
This paper investigates percolation phenomena in the Poisson zoo model on nonamenable Cayley graphs, revealing conditions under which infinite clusters form despite low density, and providing examples with unique infinite clusters.
Contribution
It demonstrates that for nonamenable graphs, infinite clusters can occur at arbitrarily low densities with certain lattice animal measures, and introduces a unique infinite cluster example on a specific graph product.
Findings
Infinite clusters form at any positive intensity on nonamenable free products with infinite second moment measures.
Worm-shaped lattice animals also produce infinite clusters at any positive intensity on nonamenable graphs.
An example with a unique infinite cluster exists on a specific graph product with finite first moment measure.
Abstract
In the Poisson zoo on an infinite Cayley graph , we take a probability measure on rooted finite connected subsets, called lattice animals, and place i.i.d. Poisson() copies of them at each vertex. If the expected volume of the animals w.r.t. is infinite, then the whole is covered for any . If the second moment of the volume is finite, then it is easy to see that for small enough the union of the animals has only finite clusters, while for large enough there are also infinite clusters. Here we show that: 1. If is a nonamenable free product, then for ANY with infinite second but finite first moment and any , there will be infinite clusters, despite having arbitrarily low density. 2. The same result holds for ANY nonamenable , when the lattice animals are worms: random walk pieces of random finite…
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Point processes and geometric inequalities · Random Matrices and Applications
