Related papers: Characterizing Continuous Time Random Walks on Tim…
We present analytical results for the distribution of first-passage (FP) times of random walks (RWs) on random regular graphs that consist of $N$ nodes of degree $c \ge 3$. Starting from a random initial node at time $t=0$, at each time…
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…
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…
We investigate aging continuous time random walks (ACTRW), introduced by Monthus and Bouchaud [{\em J. Phys. A} {\bf 29}, 3847 (1996)]. Statistical behaviors of the displacement of the random walker ${\bf r}={\bf r}(t) - {\bf r}(0)$ in the…
We show that, in a broad class of continuous time random walks (CTRW), a small external field can turn diffusion from standard into anomalous. We illustrate our findings in a CTRW with trapping, a prototype of subdiffusion in disordered and…
A correlated Gaussian random walk(CGRW) model is proposed as a simple model of animal dispersal. The general features of CGRW is described. We will discuss how from this single model a number of different kinds of correlated random walk can…
We consider a one-dimensional continuous time random walk (CTRW) on a fixed time interval $T$ where at each time step the walker waits a random time $\tau$, before performing a jump drawn from a symmetric continuous probability distribution…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
The uncoupled Continuous Time Random Walk (CTRW) in one space-dimension and under power law regime is splitted into three distinct random walks: (rw_1), a random walk along the line of natural time, happening in operational time; (rw_2), a…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and…
. In this paper we give a survey of some recent results for random walk in random scenery (RWRS). On $\mathbb {Z}^d$, $d\geq 1$, we are given a random walk with i.i.d. increments and a random scenery with i.i.d. components. The walk and the…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…
We introduce the continuous-time vertex-reinforced random walk (cVRRW) as a continuous-time version of the vertex-reinforced random walk (VRRW), which might open a new perspective on the study of the VRRW. It has been proved by Limic and…
For the first time, the diffusion phase diagram in highly confined colloidal systems, predicted by Continuous Time Random Walk (CTRW), is experimentally obtained. Temporal and spatial fractional exponents, $\alpha$ and $\mu$, introduced…
Graph processes that unfold in continuous time are of obvious theoretical and practical interest. Particularly useful are those whose long-term behavior converges to a graph distribution of known form. Here, we review some of the conditions…
A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…
A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…