Related papers: A connection between the random pinning model and …
We consider a random walker whose motion is tethered around a focal point. We use two models that exhibit the same spatial dependence in the steady state but widely different dynamics. In one case, the walker is subject to a deterministic…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…
Random walks in cones have the double interest of being at the heart of many probabilistic problems and of being related to many mathematical fields, such as spectral theory, combinatorics, or discrete complex analysis. In this article, we…
The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional…
Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…
In this paper, we introduce random walks with absorbing states on simplicial complexes. Given a simplicial complex of dimension $d$, a random walk with an absorbing state is defined which relates to the spectrum of the $k$-dimensional…
We view random walks as the paths of foraging animals, perhaps searching for food or avoiding predators while forming a mental map of their surroundings. The formation of such maps requires them to memorise the locations they have visited.…
Let $Z^1$ and $Z^2$ be partition functions in the random polymer model in the same environment but driven by different underlying random walks. We give a comparison in concave stochastic order between $Z^1$ and $Z^2$ if one of the random…
Quantum random walks use interference to obtain faster state space exploration, which can be used for algorithmic purposes. Photonic technologies provide a natural platform for many recent experimental demonstrations. Here we analyze…
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
We consider a discrete-time continuous-space random walk under the constraints that the number of returns to the origin (local time) and the total area under the walk are fixed. We first compute the joint probability of an excursion having…
We study the asymptotic distribution of random walks on $\mathbb Z^d$ ($d\ge1$) in deterministic reversible environments defined by an assignment of a positive conductance to each edge of $\mathbb Z^d$. We identify a deterministic set of…
A possible mechanism leading to anomalous diffusion is the presence of long-range correlations in time between the displacements of the particles. Fractional Brownian motion, a non-Markovian self-similar Gaussian process with stationary…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
Fractional Brownian motion, a stochastic process with long-time correlations between its increments, is a prototypical model for anomalous diffusion. We analyze fractional Brownian motion in the presence of a reflecting wall by means of…
We present the analytical and numerical results of a random walk on the family of small-world graphs. The average access time shows a crossover from the regular to random behavior with increasing distance from the starting point of the…
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…
A random walk on a $N$-dimensional hypercube is a discrete time stochastic process whose state space is the set $\{-1,+1\}^{N}$, which has uniform probability of reaching any neighbour state, and probability zero of reaching a non-neighbour…