Related papers: Intermittent random walks for an optimal search st…
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in $\mathcal O(\sqrt n)$ time for $n$…
We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…
In this paper we are interested in the task of searching and tracking multiple moving targets in a bounded surveillance area with a group of autonomous mobile agents. More specifically, we assume that targets can appear and disappear at…
Many physical phenomena are modeled as stochastic searchers looking for targets. In these models, the probability that a searcher finds a particular target, its so-called hitting probability, is often of considerable interest. In this work…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
In this paper, we deal with a size-variable group of pedestrians moving in a unknown confined environment and searching for an exit. Pedestrian dynamics are simulated by means of a recently introduced microscopic (agent-based) model,…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
An overview is presented of recent work on some statistical problems on multiparticle random walks. We consider a Euclidean, deterministic fractal or disordered lattice and N >> 1 independent random walkers initially (t=0) placed onto the…
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…
We study analytically, in one dimension, the survival probability $P_{s}(t)$ up to time $t$ of an immobile target surrounded by mutually noninteracting traps each performing a continuous-time random walk (CTRW) in continuous space. We…
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously…
We consider a recurrent random walk of i.i.d. increments on the one-dimensional integer lattice and obtain a formula relating the hitting distribution of a half-line with the potential function, $a(x)$, of the random walk. Applying it, we…
We evaluate the limit distribution of the maximal excursion of a random walk in any dimension for homogeneous environments and for self-similar supports under the assumption of spherical symmetry. This distribution is obtained in closed…
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…
We define a new class of random walk processes which maximize entropy. This maximal entropy random walk is equivalent to generic random walk if it takes place on a regular lattice, but it is not if the underlying lattice is irregular. In…
We study the random walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a…
We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We show a very strong form of intermittency, where with high probability most of the mass of the system is…
We study the problem of a random walk on a lattice in which bonds connecting nearest neighbor sites open and close randomly in time, a situation often encountered in fluctuating media. We present a simple renormalization group technique to…