SearcharxivSearch

arXiv subjects

Matthew Junge

Publications and source records attributed to Matthew Junge.

At least 19 recordsLinked to original sources

Activated random walk exhibits self-organized criticality

To explain the ubiquity of power laws and fractals in nature, Bak, Tang, and Wiesenfeld formulated simple conditions for a system to self-organize into a critical state. Dickman, Mu\~noz, Vespignani, and Zapperi postulated that the self-organized critical state matches the critical state in corresponding fixed-energy models undergoing traditional phase transitions. Although the theory has been applied broadly over the past five decades, no mathematical model has been proven to exhibit the conjectured behavior. Indeed, the originally proposed abelian sandpile model displays nonuniversal behavior stemming from its slow mixing. Marking the first result of its kind, we prove that the 1-d activated random walk model mixes quickly into a stationary state with power-law avalanches and limiting critical density that equals the critical value for the fixed-energy version.

cond-mat.stat-mech

Scaling limit and density conjecture for activated random walk on the complete graph

We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the stationary distribution has a Gumbel scaling limit for $\exp(-n^{1/3}) \ll q_n \ll n^{-1/2}$. The particular scaling implies that $S_n$ is hyperuniform and thus the stationary configuration law has negative correlations and is not a product measure. We also prove that $S_n/n$ converges to $p$ if and only if $q_n = e^{-o(n)}$, and that, when $q_n=0$, the number of jumps to stabilization undergoes a phase transition at density $p$.

math.PR

The frog model with death revisited

We prove that the probability the frog model with death and drift on the $d$-ary tree is recurrent can be made positive and thus is not monotone in the drift parameter.

math.PR

Chase-escape with conversion on the complete graph

We prove that chase-escape with conversion on the complete graph undergoes a phase transition at equal fitness and derive simple asymptotic formulas for the extinction probability, the total number of converted sites, and the expected number of surviving sites.

math.PR

Activated random walk on the comb

The density conjecture for activated random walk on the interval was recently resolved using a new tool called layer percolation. As a step towards understanding how layer percolation extends to activated random walk on more complex graphs, we develop its analog for the comb graph and use it to prove bounds on the critical density. Additionally, we provide simulation evidence suggesting that the comb has different critical densities on its spine and teeth, both of which are smaller than the critical density for the interval.

math.PR

Chase-escape with conversion as a multiple sclerosis lesion model

We introduce conversion to the stochastic process known as chase-escape in an effort to model aspects of inflammatory damage from multiple sclerosis. We prove monotonicity results for aggregate damage for the model on the positive integers, trees, stars, and the complete graph. Additionally, we establish the existence and asymptotic order of a phase transition on bounded degree graphs with a non-trivial site percolation threshold.

math.PR

Cutoff for activated random walk

We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof uses a new result for arbitrary graphs showing that the chain is mixed once activity is likely at every site.

math.PR

The hockey-stick conjecture for activated random walk

We prove a conjecture of Levine and Silvestri that the driven-dissipative activated random walk model on an interval drives itself directly to and then sustains a critical density. This marks the first rigorous confirmation of a sandpile model behaving as in Bak, Tang, and Wiesenfeld's original vision of self-organized criticality.

math.PR

The density conjecture for activated random walk

Bak, Tang, and Wiesenfeld developed their theory of self-organized criticality in the late 1980s to explain why many real-life processes exhibit signs of critical behavior despite the absence of a tuning parameter. A decade later, Dickman, Mu\~noz, Vespignani, and Zapperi explained self-organized criticality as an external force pushing a hidden parameter toward the critical value of a traditional absorbing-state phase transition. As evidence, they observed empirically that for various sandpile models, the particle density in a finite box under driven-dissipative dynamics converges to the critical density of an infinite-volume version of the model. We give the first proof of this well-known density conjecture in any setting by establishing it for activated random walk in one dimension. We prove that two other natural versions of the model have the same critical value, further establishing activated random walk as a universal model of self-organized criticality.

math.PR

Four-parameter coalescing ballistic annihilation

In coalescing ballistic annihilation, infinitely many particles move with fixed velocities across the real line and, upon colliding, either mutually annihilate or generate a new particle. We compute the critical density in symmetric three-velocity systems with four-parameter reaction equations.

math.PR

Diffusion-limited annihilating-coalescing systems

We study a family of interacting particle systems with annihilating and coalescing reactions. Two types of particles are interspersed throughout a transitive unimodular graph. Both types diffuse as simple random walks with possibly different jump rates. Upon colliding, like particles coalesce up to some cap and unlike particles annihilate. We describe a phase transition as the initial particle density is varied and provide estimates for the expected occupation time of the root. For the symmetric setting with no cap on coalescence, we prove that the limiting occupation probability of the root is asymptotic to 2/3 the occupation probability for classical coalescing random walk. This addresses an open problem from Stephenson.

math.PR

Critical drift estimates for the frog model on trees

Place an active particle at the root of a $d$-ary tree and a single dormant particle at each non-root site. In discrete time, active particles move towards the root with probability $p$ and, otherwise, away from the root to a uniformly sampled child vertex. When an active particle moves to a site containing a dormant particle, the dormant particle becomes active. The critical drift $p_d$ is the infimum over all $p$ for which infinitely many particles visit the root almost surely. Guo, Tang, and Wei proved that $\sup_{d\geq 3} p_d \leq 1/3$. We improve this bound to $5/17$ with a shorter argument that generalizes to give bounds on $\sup_{d \geq m} p_d$. We additionally prove that $\limsup p_d \leq 1/6$ by finding the limiting critical drift for a non-backtracking variant.

math.PR

Distance-dependent chase-escape on trees

We give a necessary and sufficient condition for species coexistence in a parasite-host growth process on infinite $d$-ary trees. The novelty of this work is that the spreading and death rates for hosts depend on the distance to the nearest parasite.

math.PR

Arrivals are universal in coalescing ballistic annihilation

Coalescing ballistic annihilation is an interacting particle system intended to model features of certain chemical reactions. Particles are placed with independent and identically distributed spacings on the real line and begin moving with velocities sampled from $-1,0,$ and $1$. Collisions result in either coalescence or mutual annihilation. For a variety of symmetric coalescing rules, we prove that the index of the first particle to arrive at the origin does not depend on the law for spacings between particles.

math.PR

A stochastic combustion model with thresholds on trees

Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any dormant particles there become active. For this process on infinite $d$-ary trees, we show that total root visits undergoes a phase transition.

math.PR

Non-universality in clustered ballistic annihilation

In ballistic annihilation, infinitely many particles with randomly assigned velocities move across the real line and mutually annihilate upon contact. We introduce a variant with superimposed clusters of multiple stationary particles. Our main result is that the critical initial cluster density to ensure species survival depends on both the mean and variance of the cluster size. Our result contrasts with recent ballistic annihilation universality findings with respect to particle spacings. A corollary of our theorem resolves an open question for coalescing ballistic annihilation.

math.PR

Chase-escape on the configuration model

Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process. Given a growing sequence of finite graphs, the critical rate $\lambda_c$ is the largest value of $\lambda$ for which red fails to reach a positive fraction of the vertices with high probability. We provide a conjecturally sharp lower bound and an implicit upper bound on $\lambda_c$ for supercritical random graphs sampled from the configuration model with independent and identically distributed degrees with finite second moment. We additionally show that the expected number of sites occupied by red undergoes a phase transition and identify the location of this transition.

math.PR