Related papers: Number of distinct sites visited by a subdiffusive…

On the trace of a discrete-time simple random walk on $\mathbb{Z}^d$ for $d\geq 2$, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For $d=2$, we show that almost surely three…

Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…

We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…

We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…

Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…

The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…

We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…

Commonly, normal diffusive behavior is characterized by a linear dependence of the second central moment on time, $< x^2(t) >\propto t$, while anomalous behavior is expected to show a different time dependence, $ < x^2(t) > \propto…

In this paper, we study favorite sites of one-dimensional asymmetric simple random walks. We show that almost surely, for any fixed integer $r\geq 1$, ``$r$ favorite sites" occurs infinitely often. We also give the asymptotic growth rate of…

We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…

Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…

Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…

In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is at variance with respect to the simple symmetric random walk…

We consider a self-attracting random walk in dimension d=1, in presence of a field of strength s, which biases the walker toward a target site. We focus on the dynamic case (true reinforced random walk), where memory effects are implemented…

We consider a transient excited random walk on $Z$ and study the asymptotic behavior of the occupation time of a currently most visited site. In particular, our results imply that, in contrast to the random walks in random environment, a…

We propose an analytical method to determine the shape of density profiles in the asymptotic long time limit for a broad class of coupled continuous time random walks which operate in the ballistic regime. In particular, we show that…

We calculate the explicit probability distribution function for the flux between sites in a simple discrete time diffusive system composed of independent random walkers. We highlight some of the features of the distribution and we discuss…