Related papers: Random walks with long-range steps generated by fu…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
Diffusion in a confining potential offers a minimal setting to understand the interplay between random motion and deterministic forces driving a particle towards a focal point or potential minimum. In continuous space and time, two…
We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…
For $\lambda>0$, we define a $\lambda$-damped random walk to be a random walk that is started from a random vertex of a graph and stopped at each step with probability $\frac{\lambda}{1+\lambda}$, otherwise continued with probability…
Given a non-negative Jacobi matrix describing higher order recurrence relations for multiple orthogonal polynomials of type~II and corresponding linear forms of type I, a general strategy for constructing a pair of stochastic matrices, dual…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
Rare event statistics for random walks on complex networks are investigated using the large deviations formalism. Within this formalism, rare events are realized as typical events in a suitably deformed path-ensemble, and their statistics…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
It is well known that the weak limit of a suitably scaled continuous-time random walk (CTRW) is the Brownian motion. We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs and their…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
L\'evy flights and L\'evy walks serve as two paradigms of random walks resembling common features but also bearing fundamental differences. One of the main dissimilarities are discontinuity versus continuity of their trajectories and…
We propose a random walks based model to generate complex networks. Many authors studied and developed different methods and tools to analyze complex networks by random walk processes. Just to cite a few, random walks have been adopted to…
The Weierstrass random walk is a paradigmatic Markov chain giving rise to a L\'evy-type superdiffusive behavior. It is well known that Special Relativity prevents the arbitrarily high velocities necessary to establish a superdiffusive…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…
We investigate the lattice walk performed by a tagged member of an infinite `sea' of particles filling a d-dimensional lattice, in the presence of a Brownian vacancy. Particle-particle exchange is forbidden; the only interaction between…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…
The movement of organisms and cells can be governed by occasional long distance runs, according to an approximate L\'evy walk. For T cells migrating through chronically-infected brain tissue, runs are further interrupted by long pauses, and…
Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…