Resource competition and survival for random walkers on complex networks
Abstract
We consider the problem of W random walkers on a complex network where each walker requires an amount θ of resource at each time to survive. Resource is stochastically produced at each vertex of the network with a specified distribution. The survival time of the system of walkers is defined as the time required for all W walkers to die. Using numerical simulations, we show that Erd{\H o}s-Rényi networks a have higher mean survival time than Scale-free networks as expected, but also that uniform distribution production leads to higher mean survival time than exponential distribution with the same mean. We derive an exact expression for the survival-time distribution under the assumption of independent walker lifespans, and use it to show that scale-free network topology produces strong dependence in the lifespans but homogeneous topology does not. We moreover demonstrate how the survival time can be substantially increased without changing the resource production or network topology by appropriately biasing the movement of the walkers towards low degree vertices on Scale-free networks, but has no effect on Erd{\H o}s-R{é}nyi networks.
Related
- A sharp survival threshold for branching Brownian motion in a self-generated resource environment
- Efficient Joint Trajectory Optimization and Resource Allocation for Secure UAV Networks: A Deep Reinforcement Learning Approach
- Neutral-Atom-based Quantum Optimization for Resource Allocation in NOMA Networks
- Graph Neural Networks for Resource Allocation in Integrated Sensing and Communication
- Distributed Stochastic Extremum Seeking for Optimal Resource Allocation over Networks with Time Delays
BibTeX
@misc{shekatkar2026resource,
title = {{Resource competition and survival for random walkers on complex networks}},
author = {Snehal Shekatkar},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.33831},
eprint = {2610.33831},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.33831},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Resource competition and survival for random walkers on complex networks
AU - Snehal Shekatkar
PY - 2026
DA - 2026/10/24
PB - arXiv
DO - 10.48550/arxiv.2610.33831
UR - https://arxiv.org/abs/2610.33831
AB - We consider the problem of W random walkers on a complex network where each walker requires an amount θ of resource at each time to survive. Resource is stochastically produced at each vertex of the network with a specified distribution. The survival time of the system of walkers is defined as the time required for all W walkers to die. Using numerical simulations, we show that Erd{\H o}s-Rényi networks a have higher mean survival time than Scale-free networks as expected, but also that uniform distribution production leads to higher mean survival time than exponential distribution with the same mean. We derive an exact expression for the survival-time distribution under the assumption of independent walker lifespans, and use it to show that scale-free network topology produces strong dependence in the lifespans but homogeneous topology does not. We moreover demonstrate how the survival time can be substantially increased without changing the resource production or network topology by appropriately biasing the movement of the walkers towards low degree vertices on Scale-free networks, but has no effect on Erd{\H o}s-R{é}nyi networks.
ER -