Survival probability of a lazy prey on lattices and complex networks

. We develop a framework to analyse the survival probability of a prey following a minimal effort evasion strategy, that is being chased by N predators on finite lattices or complex networks. The predators independently perform random walks if the prey is not within their sighting radius, whereas, t...

Full description

Saved in:
Bibliographic Details
Published in:The European physical journal. E, Soft matter and biological physics Soft matter and biological physics, 2020, Vol.43 (8), p.53-53, Article 53
Main Authors: Patwardhan, Siddharth, De, Rumi, Panigrahi, Prasanta K.
Format: Article
Language:English
Subjects:
Biological and Medical Physics
Biophysics
Complex Fluids and Microfluidics
Complex Systems
Computer simulation
Condensed matter physics
Decay rate
Lattices (mathematics)
Mathematical models
Nanotechnology
Networks
Nodes
Permutations
Physics
Physics and Astronomy
Polymer Sciences
Predator-prey simulation
Predators
Random walk
Regular Article
Robustness (mathematics)
Soft and Granular Matter
Surfaces and Interfaces
Survival
Thin Films
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:. We develop a framework to analyse the survival probability of a prey following a minimal effort evasion strategy, that is being chased by N predators on finite lattices or complex networks. The predators independently perform random walks if the prey is not within their sighting radius, whereas, the prey only moves when a predator moves onto a node within its sighting radius. We verify the proposed framework on three different finite lattices with periodic boundaries through numerical simulations and find that the survival probability ( P sur ) decays exponentially with a decay rate proportional to P ( N , k ) (number of permutations), where k is the minimum number of predators required to capture a prey. We then extend the framework onto complex networks and verify its robustness on the networks generated by the Watts-Strogatz (W-S), Barabási-Albert (B-A) models and a few real-world networks. Our analysis predicts that, for the considered lattices, P sur reduces as the degree of the nodes of the lattice is increased. However, for networks, P sur initially increases with the average degree of the nodes, reaches a maximum, and then decreases. Furthermore, we analyse the effect of the long-range connections in networks on P sur in W-S networks. The proposed framework enables one to study the survival probability of such a prey being hunted by multiple predators on any given structure. Graphical abstract
ISSN:1292-8941
1292-895X
DOI:10.1140/epje/i2020-11979-2