Related papers: Hitting time of large subsets of the hypercube
We study and compare equilibrium and aging dynamics on both sides of the ideal glass transition temperature $T_{MCT}$. In the context of a mean field model, we observe that all dynamical behaviors are determined by the energy distance…
The cover time is defined as the time needed for a random walker to visit every site of a confined domain. Here, we focus on persistent random walks, which provide a minimal model of random walks with short range memory. We derive the exact…
Many out of equilibrium phenomena, such as diffusion-limited reactions or target search processes, are controlled by first-passage events. So far the general determination of the mean first-passage time (FPT) to a target in confinement has…
We study the effect of temperature shift on aging phenomena in the Random Energy Model (REM). From calculation on the correlation function and simulation on the Zero-Field-Cooled magnetization, we find that the REM satisfies a scaling…
The random first order transition theory of the dynamics of supercooled liquids is extended to treat aging phenomena in nonequilibrium structural glasses. A reformulation of the idea of ``entropic droplets'' in terms of libraries of local…
Consider a simple random walk on a realization of an Erd\H{o}s-R\'enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture, we prove a Central Limit Theorem (CLT)…
We present a novel mechanism for the anomalous behaviour of the specific heat in low-temperature amorphous solids. The analytic solution of a mean-field model belonging to the same universality class as high-dimensional glasses, the…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
Characterizing the frequency-dependent response of amorphous systems and glasses can provide important insights into their physics. Here, we study the response of an electron glass, where Coulomb interactions are important and have…
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…
We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…
We rigorously analyze the low temperature non-equilibrium dynamics of the East model, a special example of a one dimensional oriented kinetically constrained particle model, when the initial distribution is different from the reversible one…
We define the model of two-dimensional random interlacements using simple random walk trajectories conditioned on never hitting the origin, and then obtain some properties of this model. Also, for random walk on a large torus conditioned on…
We study the propagation of a hole in degenerate (paramagnetic) spin environments. This canonical problem has important connections to a number of physical systems, and is perfectly suited for experimental realization with ultra-cold atoms…
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…
Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers…
The main results in this paper are about the full coalescence time $\mathsf{C}$ of a system of coalescing random walks over a finite graph $G$. Letting $\mathsf{m}(G)$ denote the mean meeting time of two such walkers, we give sufficient…
The expected hitting time of discrete quantum walks on a hypercube (HC) is numerically known to be exponentially shorter than that of their classical analogs in terms of the scaling with the HC dimension. Recent numerical analyses…