Depletion-Controlled Starvation of a Diffusing Forager
Abstract
We study the starvation of a lattice random walker in which each site initially contains one food unit and the walker can travel S steps without food before starving. When the walker encounters food, the food is completely eaten, and the walker can again travel S steps without food before starving. When the walker hits an empty site, the time until the walker starves decreases by 1. In spatial dimension d=1, the average lifetime of the walker <τ> S, while for d > 2, <τ>(Sω), with ω 1 as d∞. In the marginal case of d=2, <τ> Sz, with z≈ 2. Long-lived walks explore a highly ramified region so they always remains close to sources of food and the distribution of distinct sites visited does not obey single-parameter scaling.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.