相关论文: Inverse square L\'evy walks are not optimal search…
We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…
Continuous time random walks and Langevin equations are two classes of stochastic models for describing the dynamics of particles in the natural world. While some of the processes can be conveniently characterized by both of them, more…
Task allocation is an important problem for robot swarms to solve, allowing agents to reduce task completion time by performing tasks in a distributed fashion. Existing task allocation algorithms often assume prior knowledge of task…
For both Levy flight and Levy walk search processes we analyse the full distribution of first-passage and first-hitting (or first-arrival) times. These are, respectively, the times when the particle moves across a point at some given…
Elephant random walks were studied recently in \cite{mukherjee2025elephant} on the groups $\mathbb{Z}^{*d_1} * \mathbb{Z}_2^{*d_2}$ whose Cayley graphs are infinite $d$-regular trees with $d = 2d_1 + d_2$. It was found that for $d \ge 3$,…
We study scenarii linked with the Swiss cheese picture in dimension three obtained when two random walks are forced to meet often, or when one random walk is forced to squeeze its range. In the case of two random walks, we show that they…
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…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
This article considers the statistical properties of L\'evy walks possessing a regular long-term linear scaling of the mean square displacement with time, for which the conditions of the classical Central Limit Theorem apply.…
It is recognised now that a variety of real-life phenomena ranging from diffuson of cold atoms to motion of humans exhibit dispersal faster than normal diffusion. L\'evy walks is a model that excelled in describing such superdiffusive…
In search for mathematically tractable models of anomalous diffusion, we introduce a simple dynamical system consisting of a chain of coupled maps of the interval whose Lyapunov exponents vanish everywhere. The volume preserving property…
Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously…
A powerful strategy to accelerate quantum-walk-based search algorithms leverages on resetting protocols, where a detector monitors a target site and the evolution of the walker is restarted if no detection occurs within a fixed time…
We introduce the quantum Levy walk to study transport and decoherence in a quantum random model. We have derived from second order perturbation theory the quantum master equation for a \textit{Levy-like particle}that moves along a lattice…
We investigate a L\'evy-Walk alternating between velocities $\pm v_0$ with opposite sign. The sojourn time probability distribution at large times is a power law lacking its mean or second moment. The first case corresponds to a ballistic…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
Integral transform method (Fourier or Laplace transform, etc) is more often effective to do the theoretical analysis for the stochastic processes. However, for the time-space coupled cases, e.g., L\'evy walk or nonlinear cases, integral…
We consider a Levy flyer of order alpha that starts from a point x0 on an interval [O,L] with absorbing boundaries. We find a closed-form expression for the average number of flights the flyer takes and the total length of the flights it…
In this paper we investigate the asymptotic properties of the wait-first and jump-first L\'evy walk with rest, which is a generalization of standard jump-first and jump-first L\'evy walk that assumes each waiting time in the model is a sum…
The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…