Search arXivSearch

arXiv · 2103.10865

Comment on "Inverse Square L\'evy Walks are not Optimal Search Strategies for d $\geq$ 2" [Phys. Rev. Lett. 124, 080601 (2020)]

Abstract

It is widely accepted that inverse square L\'evy walks are optimal search strategies because they maximize the encounter rate with sparse, randomly distributed, replenishable targets when the search restarts in the vicinity of the previously visited target, which becomes revisitable again with high probability, i.e., non-destructive foraging [Nature 401, 911 (1999)]. The precise conditions for the validity of this L\'evy flight foraging hypothesis (LFH) have been widely described in the literature [Phys. Life Rev. 14, 94 (2015)]. Nevertheless, three objecting claims to the LFH have been raised recently for $d \geq 2$: (i) the capture rate $\eta$ has linear dependence on the target density $\rho$ for all values of the L\'evy index $\alpha$; (ii) "the gain $\eta_{max}/\eta$ achieved by varying $\alpha $ is bounded even in the limit $\rho \to 0 $" so that "tuning $\alpha$ can only yield a marginal gain"; (iii) depending on the values of the radius of detection $a$, the restarting distance $l_c$ and the scale parameter $s$, the optimum is realized for a range of $\alpha$ [Phys. Rev. Lett. 124, 080601 (2020)]. Here we answer each of these three criticisms in detail and show that claims (i)-(iii) do not actually invalidate the LFH. Our results and analyses restore the original result of the LFH for non-destructive foraging.

Explore related subjects

Keep this discovery

BibTeXRIS

S. V. Buldyrev, E. P. Raposo, F. Bartumeus, S. Havlin, F. R. Rusch, M. G. E. da Luz, G. M. Viswanathan. 2021-03-19. Comment on "Inverse Square L\'evy Walks are not Optimal Search Strategies for d $\geq$ 2" [Phys. Rev. Lett. 124, 080601 (2020)]. https://doi.org/10.1103/physrevlett.126.048901

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech