Related papers: Hitting time of large subsets of the hypercube
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
We consider a simple model of a structural glass, represented by a lattice gas with kinetic constraints in contact with a particle reservoir. Quench below the glass transition is represented by the jump of the chemical potential above a…
Random walks provide a simple conventional model to describe various transport processes, for example propagation of heat or diffusion of matter through a medium. However, in many practical cases the medium is highly irregular due to…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
Aging phenomena of short-range Ising spin glass models have been investigated using Monte Carlo simulations. It is found that in the low-temperature spin-glass phase the mean domain size exhibits a crossover from a power-law growth…
We study the random energy model with a hierarchical structure known as the generalized random energy model (GREM). In contrast to the original analysis by the microcanonical ensemble formalism, we investigate the GREM by the canonical…
We numerically analyze the statistics of the heat flow between an aging system and its thermal bath, following a method proposed and tested for a spin-glass model in a recent Letter (P. Sibani and H.J. Jensen, Europhys. Lett.69, 563…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…
Many recent experiments probed the off equilibrium dynamics of spin glasses and other glassy systems through temperature cycling protocols and observed memory and rejuvenation phenomena. Here we show through numerical simulations, using…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
We describe an efficient Monte Carlo algorithm using a random walk in energy space to obtain a very accurate estimate of the density of states for classical statistical models. The density of states is modified at each step when the energy…
The Glauber dynamics of various models (REM-like trap models, Brownian motion, BM model, Ising chain and SK model) is analyzed in relation with the existence of ageing. From a finite size Glauber matrix, we calculate a time $\tau_w(N)$…
In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…
An expression for the moment of partition function valid for any finite system size $N$ and complex power $n (\Re(n)>0)$ is obtained for a simple spin glass model termed the {\em discrete random energy model} (DREM). We investigate the…
A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…
Consider a random walk in random environment on a supercritical Galton--Watson tree, and let $\tau_n$ be the hitting time of generation $n$. The paper presents a large deviation principle for $\tau_n/n$, both in quenched and annealed cases.…
In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times.…
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on…