Source author record

Lionel Levine

Lionel Levine appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

39works
20topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

39 published item(s)

preprint2026arXiv

Mixing Times of Glauber Dynamics on Masked Language Models

Masked language models (MLMs) define local conditional distributions over tokens but do not, in general, correspond to any consistent joint distribution over sequences. This raises a fundamental question: what global distributional behavior is induced when such conditionals are used iteratively for generation? We address this question by modeling iterative masked-token resampling as a Glauber dynamics Markov chain on the discrete space of token sequences. We first show that MLM conditionals are intrinsically incompatible: we introduce a rectangle test that certifies this incompatibility and empirically verify its prevalence across modern MLMs. We then provide a theoretical analysis of the induced Markov chain. Under bounded cross-token influence, we establish a high-temperature contraction result implying $O(n\log n)$ mixing time where $n$ is the sequence length. In contrast, we prove that under a uniform local margin condition, the chain exhibits metastability, with exponentially slow escape from semantic basins at low temperatures. Empirically, we demonstrate a phase transition in mixing behavior as a function of temperature and sequence length, consistent with the theoretical predictions. We further characterize the induced stationary behavior through semantic trajectories, identifying persistent structures such as long-lived traps and recurrent semantic basins, with political content serving as a measurable case study.

preprint2020arXiv

Anxiety Detection Leveraging Mobile Passive Sensing

Anxiety disorders are the most common class of psychiatric problems affecting both children and adults. However, tools to effectively monitor and manage anxiety are lacking, and comparatively limited research has been applied to addressing the unique challenges around anxiety. Leveraging passive and unobtrusive data collection from smartphones could be a viable alternative to classical methods, allowing for real-time mental health surveillance and disease management. This paper presents eWellness, an experimental mobile application designed to track a full-suite of sensor and user-log data off an individual's device in a continuous and passive manner. We report on an initial pilot study tracking ten people over the course of a month that showed a nearly 76% success rate at predicting daily anxiety and depression levels based solely on the passively monitored features.

preprint2020arXiv

Double jump phase transition in a soliton cellular automaton

In this paper, we consider the soliton cellular automaton introduced in [Takahashi 1990] with a random initial configuration. We give multiple constructions of a Young diagram describing various statistics of the system in terms of familiar objects like birth-and-death chains and Galton-Watson forests. Using these ideas, we establish limit theorems showing that if the first $n$ boxes are occupied independently with probability $p\in(0,1)$, then the number of solitons is of order $n$ for all $p$, and the length of the longest soliton is of order $\log n$ for $p<1/2$, order $\sqrt{n}$ for $p=1/2$, and order $n$ for $p>1/2$. Additionally, we uncover a condensation phenomenon in the supercritical regime: For each fixed $j\geq 1$, the top $j$ soliton lengths have the same order as the longest for $p\leq 1/2$, whereas all but the longest have order at most $\log n$ for $p>1/2$. As an application, we obtain scaling limits for the lengths of the $k^{\text{th}}$ longest increasing and decreasing subsequences in a random stack-sortable permutation of length $n$ in terms of random walks and Brownian excursions.

preprint2016arXiv

Abelian networks I. Foundations and examples

In Deepak Dhar's model of abelian distributed processors, automata occupy the vertices of a graph and communicate via the edges. We show that two simple axioms ensure that the final output does not depend on the order in which the automata process their inputs. A collection of automata obeying these axioms is called an "abelian network". We prove a least action principle for abelian networks. As an application, we show how abelian networks can solve certain linear and nonlinear integer programs asynchronously. In most previously studied abelian networks, the input alphabet of each automaton consists of a single letter; in contrast, we propose two non-unary examples of abelian networks: "oil and water" and "abelian mobile agents".

preprint2016arXiv

Interpolating between random walk and rotor walk

We introduce a family of stochastic processes on the integers, depending on a parameter $p \in [0,1]$ and interpolating between the deterministic rotor walk (p=0) and the simple random walk (p=1/2). This p-rotor walk is not a Markov chain but it has a local Markov property: for each $x \in \mathbb{Z}$ the sequence of successive exits from $x$ is a Markov chain. The main result of this paper identifies the scaling limit of the p-rotor walk with two-sided i.i.d. initial rotors. The limiting process takes the form $\sqrt{\frac{1-p}{p}} X(t)$, where $X$ is a doubly perturbed Brownian motion, that is, it satisfies the implicit equation \begin{equation} X(t) = \mathcal{B}(t) + a \sup_{s\leq t} X(s) + b \inf_{s\leq t} X(s) \end{equation} for all $t \in [0,\infty)$. Here $\mathcal{B}(t)$ is a standard Brownian motion and $a,b<1$ are constants depending on the marginals of the initial rotors on $\mathbb{N}$ and $-\mathbb{N}$ respectively. Chaumont and Doney [CD99] have shown that the above equation has a pathwise unique solution $X(t)$, and that the solution is almost surely continuous and adapted to the natural filtration of the Brownian motion. Moreover, $\limsup X(t) = +\infty$ and $\liminf X(t) = -\infty$ [CDH00]. This last result, together with the main result of this paper, implies that the p-rotor walk is recurrent for any two-sided i.i.d. initial rotors and any $0<p<1$.

preprint2016arXiv

Laplacian growth, sandpiles and scaling limits

Laplacian growth is the study of interfaces that move in proportion to harmonic measure. Physically, it arises in fluid flow and electrical problems involving a moving boundary. We survey progress over the last decade on discrete models of (internal) Laplacian growth, including the abelian sandpile, internal DLA, rotor aggregation, and the scaling limits of these models on the lattice Z^d as the mesh size goes to zero. These models provide a window into the tools of discrete potential theory: harmonic functions, martingales, obstacle problems, quadrature domains, Green functions, smoothing. We also present one new result: rotor aggregation in Z^d has O(log r) fluctuations around a Euclidean ball, improving a previous power-law bound. We highlight several open questions, including whether these fluctuations are O(1).

preprint2015arXiv

Abelian networks III. The critical group

The critical group of an abelian network is a finite abelian group that governs the behavior of the network on large inputs. It generalizes the sandpile group of a graph. We show that the critical group of an irreducible abelian network acts freely and transitively on recurrent states of the network. We exhibit the critical group as a quotient of a free abelian group by a subgroup containing the image of the Laplacian, with equality in the case that the network is rectangular. We generalize Dhar's burning algorithm to abelian networks, and estimate the running time of an abelian network on an arbitrary input up to a constant additive error.

preprint2015arXiv

CoEulerian graphs

We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible. As an application, we address a question in chip-firing posed by Bjorner, Lovasz, and Shor in 1991, who asked for "a characterization of those digraphs and initial chip configurations that guarantee finite termination." Bjorner and Lovasz gave an exponential time algorithm in 1992. We show that this can be improved to linear time if the graph is coEulerian, and that the problem is NP-complete for general directed multigraphs.

preprint2015arXiv

Formation of an interface by competitive erosion

In 2006, the fourth author proposed a graph-theoretic model of interface dynamics called competitive erosion. Each vertex of the graph is occupied by a particle that can be either red or blue. New red and blue particles alternately get emitted from their respective bases and perform random walk. On encountering a particle of the opposite color they kill it and occupy its position. We prove that on the cylinder graph (the product of a path and a cycle) an interface spontaneously forms between red and blue and is maintained in a predictable position with high probability.

preprint2015arXiv

Mixing time and eigenvalues of the abelian sandpile Markov chain

The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph $G$. By viewing this chain as a (nonreversible) random walk on an abelian group, we give a formula for its eigenvalues and eigenvectors in terms of `multiplicative harmonic functions' on the vertices of $G$. We show that the spectral gap of the sandpile chain is within a constant factor of the length of the shortest non-integer vector in the dual Laplacian lattice, while the mixing time is at most a constant times the smoothing parameter of the Laplacian lattice. We find a surprising inverse relationship between the spectral gap of the sandpile chain and that of simple random walk on $G$: If the latter has a sufficiently large spectral gap, then the former has a small gap! In the case where $G$ is the complete graph on $n$ vertices, we show that the sandpile chain exhibits cutoff at time $\frac{1}{4π^{2}}n^{3}\log n$.

preprint2015arXiv

Multi-Eulerian tours of directed graphs

Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e)=tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is bounded in terms of the Pham index, a measure of 'Eulerianness'.

preprint2015arXiv

The divisible sandpile at critical density

The divisible sandpile starts with i.i.d. random variables ("masses") at the vertices of an infinite, vertex-transitive graph, and redistributes mass by a local toppling rule in an attempt to make all masses at most 1. The process stabilizes almost surely if m<1 and it almost surely does not stabilize if m>1, where $m$ is the mean mass per vertex. The main result of this paper is that in the critical case m=1, if the initial masses have finite variance, then the process almost surely does not stabilize. To give quantitative estimates on a finite graph, we relate the number of topplings to a discrete biLaplacian Gaussian field.

preprint2014arXiv

Apollonian structure in the Abelian sandpile

The Abelian sandpile process evolves configurations of chips on the integer lattice by toppling any vertex with at least 4 chips, distributing one of its chips to each of its 4 neighbors. When begun from a large stack of chips, the terminal state of the sandpile has a curious fractal structure which has remained unexplained. Using a characterization of the quadratic growths attainable by integer-superharmonic functions, we prove that the sandpile PDE recently shown to characterize the scaling limit of the sandpile admits certain fractal solutions, giving a precise mathematical perspective on the fractal nature of the sandpile.

preprint2014arXiv

Oil and water: a two-type internal aggregation model

We introduce a two-type internal DLA model which is an example of a non-unary abelian network. Starting with n "oil" and n "water" particles at the origin, the particles diffuse in Z according to the following rule: whenever some site x has at least 1 oil and at least 1 water particle present, it "fires" by sending 1 oil particle and 1 water particle each to an independent random neighbor x+1 or x-1. Firing continues until every site has at most one type of particles. We establish the correct order for several statistics of this model and identify the scaling limit under assumption of existence.

preprint2014arXiv

Threshold state and a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle

We prove a precise relationship between the threshold state of the fixed-energy sandpile and the stationary state of Dhar's abelian sandpile: In the limit as the initial condition tends to negative infinity, the former is obtained by size-biasing the latter according to burst size, an avalanche statistic. The question of whether and how these two states are related has been a subject of some controversy since 2000. The size-biasing in our result arises as an instance of a Markov renewal theorem, and implies that the threshold and stationary distributions are not equal even in the negative infinity limit. We prove that nevertheless in this limit the total amount of sand in the threshold state converges in distribution to the total amount of sand in the stationary state, confirming a conjecture of Poghosyan, Poghosyan, Priezzhev and Ruelle.

preprint2013arXiv

How to decompose a permutation into a pair of labeled Dyck paths by playing a game

We give a bijection between permutations of length 2n and certain pairs of Dyck paths with labels on the down steps. The bijection arises from a game in which two players alternate selecting from a set of 2n items: the permutation encodes the players' preference ordering of the items, and the Dyck paths encode the order in which items are selected under optimal play. We enumerate permutations by certain statistics, AA inversions and BB inversions, which have natural interpretations in terms of the game. We give new proofs of classical identities such as \sum_p \prod_{i=1}^n q^{h_i -1} [h_i]_q = [1]_q [3]_q ... [2n-1]_q where the sum is over all Dyck paths p of length 2n, and the h_i are the heights of the down steps of p.

preprint2012arXiv

A duality principle for selection games

A dinner table seats k guests and holds n discrete morsels of food. Guests select morsels in turn until all are consumed. Each guest has a ranking of the morsels according to how much he would enjoy eating them; these rankings are commonly known. A gallant knight always prefers one food division over another if it provides strictly more enjoyable collections of food to one or more other players (without giving a less enjoyable collection to any other player) even if it makes his own collection less enjoyable. A boorish lout always selects the morsel that gives him the most enjoyment on the current turn, regardless of future consumption by himself and others. We show the way the food is divided when all guests are gallant knights is the same as when all guests are boorish louts but turn order is reversed. This implies and generalizes a classical result of Kohler and Chandrasekaran (1971) about two players strategically maximizing their own enjoyments. We also treat the case that the table contains a mixture of boorish louts and gallant knights. Our main result can also be formulated in terms of games in which selections are made by groups. In this formulation, the surprising fact is that a group can always find a selection that is simultaneously optimal for each member of the group.

preprint2012arXiv

Equations solvable by radicals in a uniquely divisible group

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed coefficients, and X in G as the unknown. Certain word equations, such as XAXAX=B, have solutions in terms of radicals, while others such as XXAX = B do not. We obtain the first known infinite families of word equations not solvable by radicals, and conjecture a complete classification. To a word w we associate a polynomial P_w in Z[x,y] in two commuting variables, which factors whenever w is a composition of smaller words. We prove that if P_w(x^2,y^2) has an absolutely irreducible factor in Z[x,y], then the equation w(X,A)=B is not solvable in terms of radicals.

preprint2012arXiv

Fast simulation of large-scale growth models

We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle" which characterizes the odometer function of the growth process. Starting from an approximation for the odometer, we successively correct under- and overestimates and provably arrive at the correct final state. Internal diffusion-limited aggregation (IDLA) is one of the models amenable to our technique. The boundary fluctuations in IDLA were recently proved to be at most logarithmic in the size of the growth cluster, but the constant in front of the logarithm is still not known. As an application of our method, we calculate the size of fluctuations over two orders of magnitude beyond previous simulations, and use the results to estimate this constant.

preprint2012arXiv

The looping constant of Z^d

The looping constant $ξ(Z^d)$ is the expected number of neighbors of the origin that lie on the infinite loop-erased random walk in $Z^d$. Poghosyan, Priezzhev and Ruelle, and independently, Kenyon and Wilson, proved recently that $ξ(Z^2)=5/4$. We consider the infinite volume limits as $G \uparrow Z^d$ of three different statistics: (1) The expected length of the cycle in a uniform spanning unicycle of G; (2) The expected density of a uniform recurrent state of the abelian sandpile model on G; and (3) The ratio of the number of spanning unicycles of G to the number of rooted spanning trees of G. We show that all three limits are rational functions of the looping constant $ξ(Z^d)$. In the case of $Z^2$ their respective values are 8, 17/8 and 1/8.

preprint2011arXiv

How to make the most of a shared meal: plan the last bite first

If you are sharing a meal with a companion, how best to make sure you get your favourite mouthfuls? Ethiopian Dinner is a game in which two players take turns eating morsels from a common plate. Each morsel comes with a pair of utility values measuring its tastiness to the two players. Kohler and Chandrasekaharan discovered a good strategy -- a subgame perfect equilibrium, to be exact -- for this game. We give a new visual proof of their result. The players arrive at the equilibrium by figuring out their last move first and working backward. We conclude that it's never too early to start thinking about dessert.

preprint2011arXiv

Internal DLA and the Gaussian free field

In previous works, we showed that the internal DLA cluster on \Z^d with t particles is a.s. spherical up to a maximal error of O(\log t) if d=2 and O(\sqrt{\log t}) if d > 2. This paper addresses "average error": in a certain sense, the average deviation of internal DLA from its mean shape is of constant order when d=2 and of order r^{1-d/2} (for a radius r cluster) in general. Appropriately normalized, the fluctuations (taken over time and space) scale to a variant of the Gaussian free field.

preprint2011arXiv

Logarithmic fluctuations for internal DLA

Let each of n particles starting at the origin in Z^2 perform simple random walk until reaching a site with no other particles. Lawler, Bramson, and Griffeath proved that the resulting random set A(n) of n occupied sites is (with high probability) close to a disk B_r of radius r=\sqrt{n/π}. We show that the discrepancy between A(n) and the disk is at most logarithmic in the radius: i.e., there is an absolute constant C such that the following holds with probability one: B_{r - C \log r} \subset A(πr^2) \subset B_{r+ C \log r} for all sufficiently large r.

preprint2010arXiv

Driving sandpiles to criticality and beyond

A popular theory of self-organized criticality relates driven dissipative systems to systems with conservation. This theory predicts that the stationary density of the abelian sandpile model equals the threshold density of the fixed-energy sandpile. We refute this prediction for a wide variety of underlying graphs, including the square grid. Driven dissipative sandpiles continue to evolve even after reaching criticality. This result casts doubt on the validity of using fixed-energy sandpiles to explore the critical behavior of the abelian sandpile model at stationarity.

preprint2010arXiv

Parallel Chip-Firing on the Complete Graph: Devil's Staircase and Poincare Rotation Number

We study how parallel chip-firing on the complete graph K_n changes behavior as we vary the total number of chips. Surprisingly, the activity of the system, defined as the average number of firings per time step, does not increase smoothly in the number of chips; instead it remains constant over long intervals, punctuated by sudden jumps. In the large n limit we find a "devil's staircase" dependence of activity on the number of chips. The proof proceeds by reducing the chip-firing dynamics to iteration of a self-map of the circle S^1, in such a way that the activity of the chip-firing state equals the Poincare rotation number of the circle map. The stairs of the devil's staircase correspond to periodic chip-firing states of small period.

preprint2010arXiv

Rotor-router aggregation on the layered square lattice

In rotor-router aggregation on the square lattice Z^2, particles starting at the origin perform deterministic analogues of random walks until reaching an unoccupied site. The limiting shape of the cluster of occupied sites is a disk. We consider a small change to the routing mechanism for sites on the x- and y-axes, resulting in a limiting shape which is a diamond instead of a disk. We show that for a certain choice of initial rotors, the occupied cluster grows as a perfect diamond.

preprint2010arXiv

Sandpile groups and spanning trees of directed line graphs

We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose order is the number of oriented spanning trees rooted at a fixed vertex. In the case when G is regular of degree k, we show that the sandpile group of G is isomorphic to the quotient of the sandpile group of LG by its k-torsion subgroup. As a corollary we compute the sandpile groups of two families of graphs widely studied in computer science, the de Bruijn graphs and Kautz graphs.

preprint2010arXiv

The approach to criticality in sandpiles

A popular theory of self-organized criticality relates the critical behavior of driven dissipative systems to that of systems with conservation. In particular, this theory predicts that the stationary density of the abelian sandpile model should be equal to the threshold density of the corresponding fixed-energy sandpile. This "density conjecture" has been proved for the underlying graph Z. We show (by simulation or by proof) that the density conjecture is false when the underlying graph is any of Z^2, the complete graph K_n, the Cayley tree, the ladder graph, the bracelet graph, or the flower graph. Driven dissipative sandpiles continue to evolve even after a constant fraction of the sand has been lost at the sink. These results cast doubt on the validity of using fixed-energy sandpiles to explore the critical behavior of the abelian sandpile model at stationarity.

preprint2009arXiv

Diamond Aggregation

Internal diffusion-limited aggregation is a growth model based on random walk in Z^d. We study how the shape of the aggregate depends on the law of the underlying walk, focusing on a family of walks in Z^2 for which the limiting shape is a diamond. Certain of these walks -- those with a directional bias toward the origin -- have at most logarithmic fluctuations around the limiting shape. This contrasts with the simple random walk, where the limiting shape is a disk and the best known bound on the fluctuations, due to Lawler, is a power law. Our walks enjoy a uniform layering property which simplifies many of the proofs.

preprint2009arXiv

Growth Rates and Explosions in Sandpiles

We study the abelian sandpile growth model, where n particles are added at the origin on a stable background configuration in Z^d. Any site with at least 2d particles then topples by sending one particle to each neighbor. We find that with constant background height h <= 2d-2, the diameter of the set of sites that topple has order n^{1/d}. This was previously known only for h<d. Our proof uses a strong form of the least action principle for sandpiles, and a novel method of background modification. We can extend this diameter bound to certain backgrounds in which an arbitrarily high fraction of sites have height 2d-1. On the other hand, we show that if the background height 2d-2 is augmented by 1 at an arbitrarily small fraction of sites chosen independently at random, then adding finitely many particles creates an explosion (a sandpile that never stabilizes).

preprint2009arXiv

Scaling Limits for Internal Aggregation Models with Multiple Sources

We study the scaling limits of three different aggregation models on Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform deterministic analogues of random walks; and the divisible sandpile, in which each site distributes its excess mass equally among its neighbors. As the lattice spacing tends to zero, all three models are found to have the same scaling limit, which we describe as the solution to a certain PDE free boundary problem in R^d. In particular, internal DLA has a deterministic scaling limit. We find that the scaling limits are quadrature domains, which have arisen independently in many fields such as potential theory and fluid dynamics. Our results apply both to the case of multiple point sources and to the Diaconis-Fulton smash sum of domains.

preprint2008arXiv

The Rotor-Router Model on Regular Trees

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a perfect ball whenever it can be, provided the initial rotor configuration is acyclic (that is, no two neighboring vertices have rotors pointing to one another). This is proved by defining the rotor-router group of a graph, which we show is isomorphic to the sandpile group. We also address the question of recurrence and transience: We give two rotor configurations on the infinite ternary tree, one for which chips exactly alternate escaping to infinity with returning to the origin, and one for which every chip returns to the origin. Further, we characterize the possible "escape sequences" for the ternary tree, that is, binary words a_1 ... a_n for which there exists a rotor configuration so that the k-th chip escapes to infinity if and only if a_k=1.

preprint2008arXiv

The Sandpile Group of a Tree

A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case of a regular tree these sequences split, enabling us to compute the full decomposition of the sandpile group as a product of cyclic groups. This resolves in the affirmative a conjecture of E. Toumpakari concerning the ranks of the Sylow p-subgroups.

preprint2005arXiv

Spherical Asymptotics for the Rotor-Router Model in Z^d

The rotor-router model is a deterministic analogue of random walk invented by Jim Propp. It can be used to define a deterministic aggregation model analogous to internal diffusion limited aggregation. We prove an isoperimetric inequality for the exit time of simple random walk from a finite region in Z^d, and use this to prove that the shape of the rotor-router aggregation model in Z^d, suitably rescaled, converges to a Euclidean ball in R^d.