Back to search

Cornell University

MIXING TIME AND LIMIT SHAPES OF ABELIAN NETWORKS

Abstract

dc:description.abstract

Activated Random Walk (ARW) is an interacting particle system on the $d$-dimensional lattice \Zd with two types of particles: Active particles perform random walk and fall asleep at a fixed rate $\lambda$, and sleeping particles wake up if an active particle encounters them. On a finite subset V \subset \Zd it defines a Markov chain on \{0,1\}V. We prove that when $V$ is a Euclidean ball intersected with \Zd, the mixing time of the ARW Markov chain is at most $1+o(1)$ times the volume of the ball. The proof uses an exact sampling algorithm for the stationary distribution, a coupling with internal DLA, and an upper bound on the time when internal DLA fills the entire ball. These results are joint work with Lionel Levine. The stationary state of the ARW Markov chain on an interval of length n is conjectured to have a limit as n goes to infinity, and the limit is conjectured to have hyperuniformity. As a step toward proving these conjectures, we derive differential equations describing how the stationary state changes with $\lambda$ and n. Spinner Sandpile is a variant of the Abelian Sandpile Model. We prove outer and inner bounds for the stabilized configuration of Spinner Sandpiles on \mathbb{Z}d starting from a point source of particles at the origin.

Degree

thesis:*
Name thesis:degree_name
Ph. D., Mathematics
Level thesis:degree_level
Doctor of Philosophy
Discipline thesis:degree_discipline
Mathematics
Grantor
Cornell University
Year dc:date.issued
2022

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Liang, Feng
Chair dc:contributor.chair
  • Levine, Lionel
Committee members dc:contributor.committeemember
  • Moore, Justin Tatch
  • Sosoe, Philippe

Subjects

dc:subject × 4

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial 4.0 International
Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Bibid
15578808
Dc Identifier Other
ProQuest Submission ID: 13280
ProQuest Publication ID: 29323965

Chain of custody

source
Harvested from
Cornell University
Base URL
ecommons.cornell.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Liang, Feng. MIXING TIME AND LIMIT SHAPES OF ABELIAN NETWORKS. Doctor of Philosophy thesis, Cornell University, 2022. https://hdl.handle.net/1813/111998