Related papers: Optimizing persistent random searches
Consider a random medium consisting of points randomly distributed so that there is no correlation among the distances. This is the random link model, which is the high dimensionality limit (mean field approximation) for the euclidean…
We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…
First passage times (FPTs) are often used to study timescales in physical, chemical, and biological processes. FPTs generically describe the time it takes a random "searcher" to find a "target." In many systems, the important timescale is…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
When greedy search algorithms encounter a local minima or plateau, the search typically devolves into a breadth-first search (BrFS), or a local search technique is used in an attempt to find a way out. In this work, we formally analyze the…
We study the survival probability of an immobile target in presence of N independent diffusing walkers. We address the problem of the Mean Target Lifetime and its dependence on the number and initial distribution of the walkers when the…
We analyze predator-prey dynamics in one dimension in which a Brownian predator adopts a chasing strategy that consists in stochastically resetting its current position to locations previously visited by a diffusive prey. We study three…
Sparse neural networks have shown similar or better generalization performance than their dense counterparts while having higher parameter efficiency. This has motivated a number of works to learn or search for high performing sparse…
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 investigated the relationships between search efficiency, movement strategy, and non-local communication in the biological context of animal foraging. We considered situations where the members of a population of foragers perform either…
Random walks can be used to search a complex networks for a desired resource. To reduce the number of hops necessary to find the resource, we propose a search mechanism based on building random walks connecting together partial walks that…
We study the problem of searching for a fixed path $\epsilon_0\epsilon_1\cdots\epsilon_l$ on a network through random walks. We analyze the first hitting time of tracking the path, and obtain exact expression of mean first hitting time…
Diffusive search for a static target is a common problem in statistical physics with numerous applications in chemistry and biology. We look at this problem from a different perspective and investigate the statistics of encounters between…
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC'10] show…
We introduce a new class of first passage time optimization driven by threshold resetting, inspired by many natural processes where crossing a critical limit triggers failure, degradation or transition. In here, search agents are…
We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…
Efficient exploration is one of the key challenges for reinforcement learning (RL) algorithms. Most traditional sample efficiency bounds require strategic exploration. Recently many deep RL algorithms with simple heuristic exploration…
The first passage statistics of a continuous time random walker with Poisson distributed jumps on one and two dimensional infinite lattices is investigated. An exact expression for the probability of first return to the origin in one…
The phenomenology of turbulent relative dispersion is revisited. A heuristic scenario is proposed, in which pairs of tracers undergo a succession of independent ballistic separations during time intervals whose lengths fluctuate. This…
Sequential search models provide a powerful framework for studying consumer search using rich data that records the sequence of consumer actions taken during the search process. In existing empirical applications, their implementation often…