Stabilization of stochastic networks in Markovian environment
Abstract
We establish criteria under which stochastic networks in a Markovian environment stabilize, thus confirming Conjecture 7.2 from Levine-Greco [GL23]. The networks evolve on finite connected graphs G=(V,E), and their dynamics are encoded by V × V toppling matrices M, whose columns record the expected number of topplings when the environment is in stationarity. Stabilization and non-stabilization are characterized by a parameter which depends on the largest eigenvalue of the matrix M+α I, with α=1+\-M(v,v):v∈ V\. The proofs rely on the toppling random walk, in which toppled vertices are sampled according to the eigenvector associated with the largest eigenvalue of M.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.