Related papers: Hitting time of large subsets of the hypercube
Using the zero-temperature Metropolis dynamics, the time decay of the remanent magnetization in the $\pm J$ Edward-Anderson spin glass model with a uniform random distribution of ferromagnetic and antiferromagnetic interactions has been…
Experiments performed in the last years demonstrated slow relaxations and aging in the conductance of a large variety of materials. Here, we present experimental and theoretical results for conductance relaxation and aging for the…
We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…
We study the cover time of random walk on dynamical percolation on the torus $\mathbb{Z}_n^d$ in the subcritical regime. In this model, introduced by Peres, Stauffer and Steif, each edge updates at rate $\mu$ to open with probability $p$…
In this paper we show that on bounded degree graphs and general trees, the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the expected supremum of the Gaussian free field…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…
We study large deviations of the dynamical activity in the random orthogonal model (ROM). This is a fully connected spin-glass model with one-step replica symmetry breaking behaviour, consistent with the random first-order transition…
We study random walks on the dilute hypercube using an exact enumeration Master equation technique, which is much more efficient than Monte Carlo methods for this problem. For each dilution $p$ the form of the relaxation of the memory…
We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…
Hitting times provide a fundamental measure of distance in random processes, quantifying the expected number of steps for a random walk starting at node $u$ to reach node $v$. They have broad applications across domains such as network…
For random walks on graph $\mathcal{G}$ with $n$ vertices and $m$ edges, the mean hitting time $H_j$ from a vertex chosen from the stationary distribution to vertex $j$ measures the importance for $j$, while the Kemeny constant…
We demonstrate aging behavior in a simple non-linear system. Our model is a chaotic map which generates deterministically sub-diffusion. Asymptotic behaviors of the diffusion process are described using aging continuous time random walks,…
We study first order quantum phase transitions in mean-field spin glasses. We solve the quantum Random Energy Model using elementary methods and show that at the transition the eigenstate suddenly projects onto the unperturbed ground state…
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…
Random walk based distributed algorithms make use of a token that circulates in the system according to a random walk scheme to achieve their goal. To study their efficiency and compare it to one of the deterministic solutions, one is led…
We investigate the average hitting times of simple random walks on the $k$-th power graph $C_N^k$ of the cycle graph $C_N$. First, we show that the average hitting times are characterized by a difference equation corresponding to the graph…
In this paper we study the cover time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs on $\mathrm{Poi}(n)$ vertices. We show that the cover time undergoes a jump at the connectivity…
We consider random walkers that deform the medium as they move, enabling a faster motion in regions which have been recently visited. This induces an effective attraction between walkers mediated by the medium, which can be regarded as a…
We exhibit a close connection between hitting times of the simple random walk on a graph, the Wiener index, and related graph invariants. In the case of trees we obtain a simple identity relating hitting times to the Wiener index. It is…
We study the off-equilibrium relaxational dynamics of the Amit-Roginsky $\phi^3$ field theory, for which the mode coupling approximation is exact. We show that complex phenomena such as aging and ergodicity breaking are present at low…