Related papers: Universal exploration dynamics of random walks
We consider a discrete time simple symmetric random walk on Z^d, d>=1, where the path of the walk is perturbed by inserting deterministic jumps. We show that for any time n and any deterministic jumps that we insert, the expected number of…
Self-interacting random walks are endowed with long range memory effects that emerge from the interaction of the random walker at time $t$ with the territory that it has visited at earlier times $t'<t$. This class of non Markovian random…
We consider a random walk on the fully-connected lattice with $N$ sites and study the time evolution of the number of distinct sites $s$ visited by the walker on a subset with $n$ sites. A record value $v$ is obtained for $s$ at a record…
A fundamental insight in the theory of diffusive random walks is that the mean length of trajectories traversing a finite open system is independent of the details of the diffusion process. Instead, the mean trajectory length depends only…
Community assembly is studied using individual-based multispecies models. The models have stochastic population dynamics with mutation, migration, and extinction of species. Mutants appear as a result of mutation of the resident species,…
We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…
A heterogeneous continuous time random walk is an analytical formalism for studying and modeling diffusion processes in heterogeneous structures on microscopic and macroscopic scales. In this paper we study both analytically and numerically…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
We investigate the geometric properties of the convex hull over $n$ successive positions of a planar random walk, with a symmetric continuous jump distribution. We derive the large $n$ asymptotic behavior of the mean perimeter. In addition,…
We investigate the relation between the local picture left by the trajectory of a simple random walk on the torus (Z/NZ)^d, d >= 3, until u N^d time steps, u > 0, and the model of random interlacements recently introduced by Sznitman. In…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…
We introduce the notion of a "random basic walk" on an infinite graph, give numerous examples, list potential applications, and provide detailed comparisons between the random basic walk and existing generalizations of simple random walks.…
Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…
We present analytical results for the distribution of cover times of random walks (RWs) on random regular graphs consisting of $N$ nodes of degree $c$ ($c \ge 3$). Starting from a random initial node at time $t=1$, at each time step $t \ge…
A random walk starts from the origin of a d-dimensional lattice. The occupation number n(x,t) equals unity if after t steps site x has been visited by the walk, and zero otherwise. We study translationally invariant sums M(t) of observables…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…