Eternal Family Trees and Dynamics on Unimodular Random Graphs
Fran\c{c}ois Baccelli, Mir-Omid Haji-Mirsadeghi, Ali Khezeli

TL;DR
This paper classifies covariant dynamics on unimodular random graphs, introduces Eternal Family Trees as stochastic extensions of branching processes, and explores their properties and construction methods.
Contribution
It provides a comprehensive classification of vertex-shifts on unimodular networks and introduces Eternal Family Trees as a new framework extending branching process theory.
Findings
Classified vertex-shifts into three types based on component and foil cardinalities.
Introduced Eternal Family Trees as stochastic extensions of branching processes.
Unified and extended classical branching process theorems using Eternal Family Trees.
Abstract
This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network isomorphisms. Such dynamics are referred to as vertex-shifts here. The first result of the paper is a classification of vertex-shifts on unimodular random networks. Each such vertex-shift partitions the vertices into a collection of connected components and foils. The latter are discrete analogues the stable manifold of the dynamics. The classification is based on the cardinality of the connected components and foils. Up to an event of zero probability, there are three classes of foliations in a connected component: F/F (with finitely many finite foils), I/F (infinitely many finite foils), and I/I (infinitely many infinite foils). An infinite connected component of the graph of a vertex-shift on a random…
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.
