相关论文: Optimizing persistent random searches
Random search processes are instrumental in studying and understanding navigation properties of complex networks, food search strategies of animals, diffusion control of molecular processes in biological cells, and improving web search…
We study the efficiency of random search processes based on L{\'e}vy flights with power-law distributed jump lengths in the presence of an external drift, for instance, an underwater current, an airflow, or simply the bias of the searcher…
We study analytically an intermittent search process in one dimension. There is an immobile target at the origin and a searcher undergoes a discrete time jump process starting at $x_0\geq0$, where successive jumps are drawn independently…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
We consider $N$ Brownian motions diffusing independently on a line, starting at $x_0>0$, in the presence of an absorbing target at the origin. The walkers undergo stochastic resetting under two protocols: (A) each walker resets…
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…
The L\'evy hypothesis states that inverse square L\'evy walks are optimal search strategies because they maximise the encounter rate with sparse, randomly distributed, replenishable targets. It has served as a theoretical basis to interpret…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
Foraging, either solitarily or collectively, is a necessary behavior for survival that is demonstrated by many organisms. Foraging can be collectively optimized by utilizing communication between the organisms. Examples of such…
We consider a one-dimensional search process under stochastic resetting conditions. A target is located at $b\geq0$ and a searcher, starting from the origin, performs a discrete-time random walk with independent jumps drawn from a…
We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by L\'evy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary…
In this paper, we investigate the quest for a single target, that remains fixed in a lattice, by a set of independent walkers. The target exhibits a fluctuating behavior between trap and ordinary site of the lattice, whereas the walkers…
L\'evy walks are random walk processes whose step-lengths follow a long-tailed power-law distribution. Due to their abundance as movement patterns of biological organisms, significant theoretical efforts have been devoted to identifying the…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
We present a general framework, applicable to a broad class of random walks on complex networks, which provides a rigorous lower bound for the mean first-passage time of a random walker to a target site averaged over its starting position,…
We carry out a comparative study on the problem for a walker searching on several typical complex networks. The search efficiency is evaluated for various strategies. Having no knowledge of the global properties of the underlying networks…
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…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…