Related papers: Strict monotonicity properties in one-dimensional …
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
We consider a random walk on the support of an ergodic simple point process on R^d, d>1, furnished with independent energy marks. The jump rates of the random walk decay exponentially in the jump length and depend on the energy marks via a…
In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…
The branching random walk is shown to be monotone decreasing in ascending direction of integer lattices as a corollary of an observation in regard to the lineage of particles from antisymmetric initial states, and a related property of…
We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
We discuss conditions for unique ergodicity of a collective random walk on a continuous circle. Individual particles in this collective motion perform independent (and different in general) random walks conditioned by the assumption that…
We give new criteria for ballistic behavior of random walks in random environment which are perturbations of the simple symmetric random walk on $\mathbb Z^d$ in dimensions $d\ge 4$. Our results extend those of Sznitman [Ann. Probab. 31,…
The symmetries associated with discrete-time quantum walks (DTQWs) and the flexibilities in controlling their dynamical parameters allow to create a large number of topological phases. An interface in position space, which separates two…
We consider one-dimensional excited random walks (ERWs) with i.i.d. markovian cookie stacks in the non-boundary recurrent regime. We prove that under diffusive scaling such an ERW converges in the standard Skorokhod topology to a multiple…
We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
We consider a random walk on integers where at the first visits to a site the walker gets a positive drift, but where after a certain number of visits the walker gets a negative drift. We prove that the walker is almost surely transient to…
We study a $d$-dimensional random walk with exponentially distributed increments conditioned so that the components stay ordered (in the sense of Doob). We find explicitly a positive harmonic function $h$ for the killed process and then…
The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks on spiking…
The discrete stochastic dynamics of a random walker in the presence of resetting and memory is analyzed. Resetting and memory effects may compete for certain parameter regime and lead to significant changes in the long time dynamics of the…
We present a detailed analysis of random motions moving in higher spaces with a natural number of velocities. In the case of the so-called minimal random dynamics, under some wide assumptions, we show the joint distribution of the position…