Meta-heuristic algorithms are problem-solving methods which try to find good-enough
solutions to very hard optimization problems, at a reasonable computation time, where …

We review the general search problem of how to find randomly located objects that can only
be detected in the limited vicinity of a forager, and discuss its quantitative description using …

Individual human trajectories are characterized by fat-tailed distributions of jump sizes and
waiting times, suggesting the relevance of continuous-time random-walk (CTRW) models for …

Assessing the navigability of interconnected networks (transporting information, people, or
goods) under eventual random failures is of utmost importance to design and protect critical …

LéVY flights are a special class of random walks whose step lengths are not constant but
rather are chosen from a probability distribution with a power-law tail. Realizations of Lévy …

This is the second volume of a two-volume work devoted to probability theory in physical
chemistry, and engineering. Rather than dealing explicitly with the idea of an ongoing …

We address the general question of what is the best statistical strategy to adapt in order to
search efficiently for randomly located objects ('target sites'). It is often assumed in foraging …

Scale invariant patterns have been found in different biological systems, in many cases
resembling what physicists have found in other, nonbiological systems. Here we describe …

Our purpose is to describe some recent progress in applying fractal concepts to systems of
relevance to biology and medicine. We review several biological systems characterized by …

The territory explored by a random walk is a key property that may be quantified by the
number of distinct sites that the random walk visits up to a given time. We introduce a more …