Dataset Information

Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.

ABSTRACT: Recent theoretical developments had laid down the proper mathematical means to understand how the structural complexity of search patterns may improve foraging efficiency. Under information-deprived scenarios and specific landscape configurations, Lévy walks and flights are known to lead to high search efficiencies. Based on a one-dimensional comparative analysis we show a mechanism by which, at random, a searcher can optimize the encounter with close and distant targets. The mechanism consists of combining an optimal diffusivity (optimally enhanced diffusion) with a minimal diffusion constant. In such a way the search dynamics adequately balances the tension between finding close and distant targets, while, at the same time, shifts the optimal balance towards relatively larger close-to-distant target encounter ratios. We find that introducing a multiscale set of reorientations ensures both a thorough local space exploration without oversampling and a fast spreading dynamics at the large scale. Lévy reorientation patterns account for these properties but other reorientation strategies providing similar statistical signatures can mimic or achieve comparable efficiencies. Hence, the present work unveils general mechanisms underlying efficient random search, beyond the Lévy model. Our results suggest that animals could tune key statistical movement properties (e.g. enhanced diffusivity, minimal diffusion constant) to cope with the very general problem of balancing out intensive and extensive random searching. We believe that theoretical developments to mechanistically understand stochastic search strategies, such as the one here proposed, are crucial to develop an empirically verifiable and comprehensive animal foraging theory.

SUBMITTER: Bartumeus F

PROVIDER: S-EPMC4162546 | biostudies-literature | 2014

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.

Bartumeus Frederic F Raposo Ernesto P EP Viswanathan Gandhimohan M GM da Luz Marcos G E MG

PloS one 20140912 9

Recent theoretical developments had laid down the proper mathematical means to understand how the structural complexity of search patterns may improve foraging efficiency. Under information-deprived scenarios and specific landscape configurations, Lévy walks and flights are known to lead to high search efficiencies. Based on a one-dimensional comparative analysis we show a mechanism by which, at random, a searcher can optimize the encounter with close and distant targets. The mechanism consists ...[more]

PMID: 25216191

Similar Datasets

Project description:BACKGROUND:Mimicry, in which one prey species (the Mimic) imitates the aposematic signals of another prey (the Model) to deceive their predators, has attracted the general interest of evolutionary biologists. Predator psychology, especially how the predator learns and forgets, has recently been recognized as an important factor in a predator-prey system. This idea is supported by both theoretical and experimental evidence, but is also the source of a good deal of controversy because of its novel prediction that in a Model/Mimic relationship even a moderately unpalatable Mimic increases the risk of the Model (quasi-Batesian mimicry). METHODOLOGY/PRINCIPAL FINDINGS:We developed a psychology-based Monte Carlo model simulation of mimicry that incorporates a "Pavlovian" predator that practices an optimal foraging strategy, and examined how various ecological and psychological factors affect the relationships between a Model prey species and its Mimic. The behavior of the predator in our model is consistent with that reported by experimental studies, but our simulation's predictions differed markedly from those of previous models of mimicry because a more abundant Mimic did not increase the predation risk of the Model when alternative prey were abundant. Moreover, a quasi-Batesian relationship emerges only when no or very few alternative prey items were available. Therefore, the availability of alternative prey rather than the precise method of predator learning critically determines the relationship between Model and Mimic. Moreover, the predation risk to the Model and Mimic is determined by the absolute density of the Model rather than by its density relative to that of the Mimic. CONCLUSIONS/SIGNIFICANCE:Although these predictions are counterintuitive, they can explain various kinds of data that have been offered in support of competitive theories. Our model results suggest that to understand mimicry in nature it is important to consider the likely presence of alternative prey and the possibility that predation pressure is not constant.

Project description:BackgroundAnti-tumor therapies aim at reducing to zero the number of tumor cells in a host within their end or, at least, aim at leaving the patient with a sufficiently small number of tumor cells so that the residual tumor can be eradicated by the immune system. Besides severe side-effects, a key problem of such therapies is finding a suitable scheduling of their administration to the patients. In this paper we study the effect of varying therapy-related parameters on the final outcome of the interplay between a tumor and the immune system.ResultsThis work generalizes our previous study on hybrid models of such an interplay where interleukins are modeled as a continuous variable, and the tumor and the immune system as a discrete-state continuous-time stochastic process. The hybrid model we use is obtained by modifying the corresponding deterministic model, originally proposed by Kirschner and Panetta. We consider Adoptive Cellular Immunotherapies and Interleukin-based therapies, as well as their combination. By asymptotic and transitory analyses of the corresponding deterministic model we find conditions guaranteeing tumor eradication, and we tune the parameters of the hybrid model accordingly. We then perform stochastic simulations of the hybrid model under various therapeutic settings: constant, piece-wise constant or impulsive infusion and daily or weekly delivery schedules.ConclusionsResults suggest that, in some cases, the delivery schedule may deeply impact on the therapy-induced tumor eradication time. Indeed, our model suggests that Interleukin-based therapies may not be effective for every patient, and that the piece-wise constant is the most effective delivery to stimulate the immune-response. For Adoptive Cellular Immunotherapies a metronomic delivery seems more effective, as it happens for other anti-angiogenesis therapies and chemotherapies, and the impulsive delivery seems more effective than the piece-wise constant. The expected synergistic effects have been observed when the therapies are combined.

Project description:At a macroscopic level, part of the ant colony life cycle is simple: a colony collects resources; these resources are converted into more ants, and these ants in turn collect more resources. Because more ants collect more resources, this is a multiplicative process, and the expected logarithm of the amount of resources determines how successful the colony will be in the long run. Over 60 years ago, Kelly showed, using information theoretic techniques, that the rate of growth of resources for such a situation is optimized by a strategy of betting in proportion to the probability of pay-off. Thus, in the case of ants, the fraction of the colony foraging at a given location should be proportional to the probability that resources will be found there, a result widely applied in the mathematics of gambling. This theoretical optimum leads to predictions as to which collective ant movement strategies might have evolved. Here, we show how colony-level optimal foraging behaviour can be achieved by mapping movement to Markov chain Monte Carlo (MCMC) methods, specifically Hamiltonian Monte Carlo (HMC). This can be done by the ants following a (noisy) local measurement of the (logarithm of) resource probability gradient (possibly supplemented with momentum, i.e. a propensity to move in the same direction). This maps the problem of foraging (via the information theory of gambling, stochastic dynamics and techniques employed within Bayesian statistics to efficiently sample from probability distributions) to simple models of ant foraging behaviour. This identification has broad applicability, facilitates the application of information theory approaches to understand movement ecology and unifies insights from existing biomechanical, cognitive, random and optimality movement paradigms. At the cost of requiring ants to obtain (noisy) resource gradient information, we show that this model is both efficient and matches a number of characteristics of real ant exploration.

Dataset Information

Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.

Publications

Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure