Related papers: Inverse square L\'evy walks are not optimal search…
We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial…
A combined dynamics consisting of Brownian motion and L\'evy flights is exhibited by a variety of biological systems performing search processes. Assessing the search reliability of ever locating the target and the search efficiency of…
A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a…
This paper primarily investigates the geometric properties of excursions of L\'evy processes reflected at the past infimum with long lifetime or large height. For an oscillating process in the domain of attraction of a stable law, our…
The reflected process of a random walk or L\'evy process arises in many areas of applied probability, and a question of particular interest is how the tail of the distribution of the heights of the excursions away from zero behaves…
We study optimal Markovian couplings of Markov processes, where the optimality is understood in terms of minimization of concave transport costs between the time-marginal distributions of the coupled processes. We provide explicit…
A step reinforced random walk is a discrete time process with memory such that at each time step, with fixed probability $p \in (0,1)$, it repeats a previously performed step chosen uniformly at random while with complementary probability…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We consider diffusive motion of a particle performing a random walk with L\'evy distributed jump lengths and subject to resetting mechanism bringing the walker to an initial position at uniformly distributed times. In the limit of infinite…
Motion of particles in many systems exhibits a mixture between periods of random diffusive like events and ballistic like motion. In many cases, such systems exhibit strong anomalous diffusion, where low order moments $< |x(t)|^q >$ with…
The asymptotic behaviour of the survival or reunion probability of vicious walks with short-range interactions is generally well studied. In many realistic processes, however, walks interact with a long ranged potential that decays in $d$…
We consider a random walk on one-dimensional inhomogeneous graphs built from Cantor fractals. Our study is motivated by recent experiments that demonstrated superdiffusion of light in complex disordered materials, thereby termed L\'evy…
Continuous time random walks combining diffusive and ballistic regimes are introduced to describe a class of L\'evy walks on lattices. By including exponentially-distributed waiting times separating the successive jump events of a walker,…
In this work, we present a novel distributed method for constructing an occupancy grid map of an unknown environment using a swarm of robots with global localization capabilities and limited inter-robot communication. The robots explore the…
L\'evy-type walks with correlated jumps, induced by the topology of the medium, are studied on a class of one-dimensional deterministic graphs built from generalized Cantor and Smith-Volterra-Cantor sets. The particle performs a standard…
Biologically inspired strategies have long been adapted to swarm robotic systems, including biased random walks, reaction to chemotactic cues and long-range coordination. In this paper we apply analysis tools developed for modeling…
All swarm-intelligence-based optimization algorithms use some stochastic components to increase the diversity of solutions during the search process. Such randomization is often represented in terms of random walks. However, it is not yet…
Previous studies demonstrated empirically that human mobility exhibits Levy flight behaviour. However, our knowledge of the mechanisms governing this Levy flight behaviour remains limited. Here we analyze over 72 000 people's moving…
The aim of this paper is to check feasibility of using the maximal-entropy random walk in algorithms finding communities in complex networks. A number of such algorithms exploit an ordinary or a biased random walk for this purpose. Their…
We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…