Related papers: Random walks on complex networks under time-depend…
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to become active, while a jump to one of its neighbors depends…
We revisit the simple lattice random walk (P\'{o}lya walk) and the Sisyphus random walk in $\mathbb{Z}$, in the presence of random restarts. We use a relatively direct approach namely First passage under restart for discrete space and time…
We present a semi-Markov model of random walk on complex networks in discrete and continuous-time scenario. In the general setting of the semi-Markov chains, the duration of stay at given node - the sojourn time - is random, and the…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…
First passage under restart has recently emerged as a conceptual framework to study various stochastic processes under restart mechanism. Emanating from the canonical diffusion problem by Evans and Majumdar, restart has been shown to…
We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to the Laplace…
We introduce range-controlled random walks with hopping rates depending on the range $\mathcal{N}$, that is, the total number of previously distinct visited sites. We analyze a one-parameter class of models with a hopping rate…
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…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
We study the simple random walk dynamics on an annealed version of a Small-World Network (SWN) consisting of $N$ nodes. This is done by calculating the mean number of distinct sites visited S(n) and the return probability $P_{00}(t)$ as a…
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal…
We study the biased random walk where at each step of a random walk a "controller" can, with a certain small probability, move the walk to an arbitrary neighbour. This model was introduced by Azar et al. [STOC'1992]; we extend their work to…
We investigate the first passage time beyond a barrier located at $b\geq0$ of a random walk with independent and identically distributed jumps, starting from $x_0=0$. The walk is subject to stochastic resetting, meaning that after each step…
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…
The interest in non-Markovian dynamics within the complex systems community has recently blossomed, due to a new wealth of time-resolved data pointing out the bursty dynamics of many natural and human interactions, manifested in an…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
Renewal processes are zero-dimensional processes defined by independent intervals of time between zero crossings of a random walker. We subject renewal processes them to stochastic resetting by setting the position of the random walker to…
This paper considers non-backtracking random walks on random graphs generated according to the configuration model. The quantity of interest is the scaling of the mixing time of the random walk as the number of vertices of the random graph…
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear…