Construction of ergodic IDLA forests in $\mathbb{Z}^d$
Nicolas Chenavier (LMPA), David Coupier (IMT Nord Europe), Keenan Penner (LMPA), Arnaud Rousselle (UBE)

TL;DR
This paper establishes the existence of ergodic infinite-volume IDLA forests in multidimensional integer lattices, using a multi-source protocol and percolation techniques, despite the lack of Abelian property.
Contribution
It introduces a new multi-source IDLA forest model in $\
Findings
Existence of infinite-volume IDLA forests in $\
Ergodicity of the constructed IDLA forests
Use of percolation tools to prove stabilization
Abstract
We prove the existence of infinite-volume IDLA forests in , with , based on a multi-source IDLA protocol. Unlike IDLA aggregates, the laws of the IDLA forests studied here depend on the trajectories of particles, and then do not satisfy the famous Abelian property. Their existence is due to a stabilization result (Theorem 1.1, our main result) that we establish using percolation tools. Although the sources are infinitely many, we also prove that each of them play the same role in the building procedure, which results in an ergodicity property for the IDLA forests (Theorem 1.2).
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
TopicsCellular Automata and Applications · Advanced Data Storage Technologies · Algorithms and Data Compression
