Related papers: Mixing trichotomy for random walks on directed sto…
Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…
We derive probabilistic limit theorems that reveal the intricate structure of the phase transitions in a mean-field version of the Blume-Emery-Griffiths model. These probabilistic limit theorems consist of scaling limits for the total spin…
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
We study a natural random walk on the $n \times n$ upper triangular matrices, with entries in $\mathbb{Z}/m \mathbb{Z}$, generated by steps which add or subtract a uniformly random row to the row above. We show that the mixing time of this…
Although higher-order interactions are known to affect the typical state of dynamical processes giving rise to new collective behavior, how they drive the emergence of rare events and fluctuations is still an open problem. We investigate…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
Random walks and related spatial stochastic models have been used in a range of application areas including animal and plant ecology, infectious disease epidemiology, developmental biology, wound healing, and oncology. Classical random walk…
We study the mixing time of a random walker who moves inside a dynamical random cluster model on the d-dimensional torus of side-length n. In this model, edges switch at rate \mu between open and closed, following a Glauber dynamics for the…
We introduce a simple dynamical model of two interacting communities whose elements are subject to stochastic discrete-time updates governed by only bilinear interactions. When the intra- and inter-couplings are cooperative, the two…
We study the condensation regime of the finite reversible inclusion process, i.e., the inclusion process on a finite graph $S$ with an underlying random walk that admits a reversible measure. We assume that the random walk kernel is…
We consider the continuous-time quantum walk defined on the adjacency matrix of a graph. At each instant, the walk defines a mixing matrix which is doubly-stochastic. The average of the mixing matrices contains relevant information about…
We study the mixing time of a non-Markovian process, the step-reinforced random walk (SRRW) on a finite group. This process differs from a classical random walk in that at each integer time, with probability $\alpha$ the next step is chosen…
The mean-squared displacement (MSD) is an averaged quantity widely used to assess anomalous diffusion. In many cases, such as molecular motors with finite processivity, dynamics of the system of interest produce trajectories of varying…
We study the distribution of dynamical quantities in various one-dimensional, disordered models the critical behavior of which is described by an infinite randomness fixed point. In the {\it disordered contact process}, the quenched…
In this article, we consider the number of collisions of three independent simple random walks on a subgraph of the two-dimensional square lattice obtained by removing all horizontal edges with vertical coordinate not equal to 0 and then,…
In a model of self-organized criticality unstable sites discharge to just one of their neighbors. For constant discharge ratio $\alpha$ and for a certain range of values of the input energy, avalanches are simple branchless P\'olya random…
Although ubiquitous, interactions of groups of individuals (e.g., modern messaging applications, group meetings, or even a parliament discussion) are not yet thoroughly studied. Frequently, single-groups are modeled as critical-mass…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…