Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models

DOI10.1016/J.JTBI.2005.09.006MaRDI QIDQ2202115zbMATH OpenOpenAlexWikidataFDO

Authors B. R. Guru Prasad, Renee M. Borges

Publication date 17 September 2020

Published in Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jtbi.2005.09.006

zbMATH Keywords

Markov chainoptimal foragingcorrelated random walkpatch networksspace usage

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Ecology (92D40) Sums of independent random variables; random walks (60G50)

Recommendations

• A model of self-avoiding random walks for searching complex networks
• Optimal foraging strategies: Lévy walks balance searching and patch exploitation under a very broad range of conditions
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Searching efficiency of multiple walkers on the weighted networks
• Comparison of multiple random walks strategies for searching networks
• Switcher random walkers: cognitive inspired strategies for an optimized random exploration of networks
• Markovian Strategies for Spatial Dilemmas in Lattices and Networks
• Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties
• Searching efficiency on complex networks under visual range of nodes

Cites work

• scientific article; zbMATH DE number 3657507 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• scientific article; zbMATH DE number 1514781 (Why is no real title available?)
• A generalized model of optimal diets
• Optimal foraging, the marginal value theorem

Cited in

(5)

• A search theory model of patch-to-patch forager movement with application to pollinator-mediated gene flow
• On the relationship between fractal dimension and encounters in three-dimensional trajectories
• Memory matters: influence from a cognitive map on animal space use
• The influence of turning angles on the success of non-oriented animal searches
• A general approach to model movement in (highly) fragmented patch networks

Describes a project that uses

Uses Software

• Optimization Toolbox
• Matlab

This page was built for publication: Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202115)