Stationary Eden model on groups
Ton\'ci Antunovi\'c, Eviatar B. Procaccia

TL;DR
This paper studies stationary Eden models on half-plane lattices and Cayley graphs, proving that all trees are finite almost surely under weak conditions, extending previous results on related growth models.
Contribution
It introduces a generalized approach to Eden models on various graphs and proves finiteness of trees using ergodic and mass transport principles.
Findings
All trees are finite almost surely in the considered models.
The results extend to graphs of the form G×Z_+ where G is a Cayley graph.
Generalizes known results on the two-type Richardson model.
Abstract
We consider two stationary versions of the Eden model, on the upper half planar lattice, resulting in an infinite forest covering the half plane. Under weak assumptions on the weight distribution and by relying on ergodic theorems, we prove that almost surely all trees are finite. Using the mass transport principle, we generalize the result to Eden model in graphs of the form , where is a Cayley graph. This generalizes certain known results on the two-type Richardson model, in particular of Deijfen and H\"aggstr\"om in 2007.
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 · Theoretical and Computational Physics · Random Matrices and Applications
