Related papers: Mixing time trichotomy in regenerating dynamic dig…
We study random transformations built from intermittent maps on the unit interval that share a common neutral fixed point. We focus mainly on random selections of Pomeu-Manneville-type maps $T_\alpha$ using the full parameter range $0<…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
Cellular automata have been mainly studied on very regular graphs carrying the vertices (like lines or grids) and under synchronous dynamics (all vertices update simultaneously). In this paper, we study how the asynchronism and the graph…
Multitime correlation functions provide useful probes for the ensembles of trajectories underlying the stochastic dynamics of complex systems. These can be obtained by measuring their optical response to sequences of ultrashort optical…
We consider the dynamical evolution of a Brownian particle undergoing stochastic resetting, meaning that after random periods of time it is forced to return to the starting position. The intervals after which the random motion is stopped…
We study the dynamics of the Stochastic Sandpile Model on finite graphs, with two main results. First, we describe a procedure to exactly sample from the stationary distribution of the model in all connected finite graphs, extending a…
We develop a new framework to prove the mixing or relaxation time for the Glauber dynamics on spin systems with unbounded degree. It works for general spin systems including both $2$-spin and multi-spin systems. As applications for this…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…
We study Markov chains for $\alpha$-orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function $\alpha$. The set of $\alpha$-orientations of a plane graph has a…
Motivated by applications in mathematical biology concerning randomly alternating motion of micro-organisms, we analyze a generalized integrated telegraph process. The random times between consecutive velocity reversals are…
Let $X$ be a lazy random walk on a graph $G$. If $G$ is undirected, then the mixing time is upper bounded by the maximum hitting time of the graph. This fails for directed chains, as the biased random walk on the cycle $\mathbb{Z}_n$ shows.…
We study the asymptotic behavior of a discrete-in-time minimizing movement scheme for square lattice interfaces when both the lattice spacing and the time step vanish. The motion is assumed to be driven by minimization of a weighted random…
We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…
We introduce a variation of strong stationary times for random walks on the symmetric group. Rather than proceed in the usual fashion of accumulating larger and larger blocks of cards which may be in any order, we wait for pairs of cards to…
We analyze the late-time relaxation dynamics for a general contagion model. In this model, nodes are either active or failed. Active nodes can fail either "spontaneously" at any time or "externally" if their neighborhoods are sufficiently…