Local behavior of the Eden model on graphs and tessellations of manifolds
Dongming Hua, Fedor Manin, Tahda Queer, Tianyi Wang

TL;DR
This paper extends the understanding of the Eden model's boundary topology from Euclidean spaces to general graphs and non-Euclidean spaces, demonstrating that all feasible boundary shapes occur frequently over time.
Contribution
It proves that on infinite, vertex-transitive graphs, the Eden model's boundary contains all possible subgraphs with high probability, generalizing previous Euclidean results to broader spaces.
Findings
All feasible boundary subgraphs occur frequently over time.
Results extend to hyperbolic spaces and Riemannian manifold covers.
Provides probabilistic lower bounds on boundary topology.
Abstract
The Eden Model in constructs a blob as follows: initially a single unit hypercube is infected, and each second a hypercube adjacent to the infected ones is selected randomly and infected. Manin, Rold\'{a}n, and Schweinhart investigated the topology of the Eden model in by considering the possible shapes which can appear on the boundary. In particular, they give probabilistic lower bounds on the Betti numbers of the Eden model. In this paper, we prove analogous results for the Eden model on any infinite, vertex-transitive, locally finite graph: with high probability as time goes to infinity, every "possible" subgraph (with mild conditions on what "possible" means) occurs on the boundary of the Eden model at least a number of times proportional to an isoperimetric profile of the graph. Using this, we can extend the results about the topology of the Eden…
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
TopicsTopological and Geometric Data Analysis · Geometric and Algebraic Topology · Black Holes and Theoretical Physics
