arXiv · 2609.39377
Recovery Random Walks and Extreme Events on Complex Networks
Abstract
Extreme events are widely studied within simple random walk frameworks, where their probability is determined by the network structure and stationary walker distribution. Here, we propose a recovery random walk (RRW) model in which extreme events temporally `freeze' the nodes where they occur for a fixed duration $Δ$ ($Δ=0$ recovers the original model), trapping walkers and reducing the effective mobile population, thereby making the model more practical. We derive a first-principles description of this feedback and a delayed differential equation for the frozen-node fraction. This finite freezing produces an initial overshoot, followed by damped oscillatory relaxation to a steady state for the fraction of the frozen nodes. We find that freezing suppresses extreme event probability while preserving its degree dependence dynamics, and suppresses the EE frequency. Further, the analytical prediction for the fraction of the frozen nodes agrees closely with simulations. This model closely reflects real-world scenarios, yielding more practical EE statistics.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Karan Singh, Narendran R. V., V. K. Chandrasekar, D. V. Senthilkumar. 2026-09-30. Recovery Random Walks and Extreme Events on Complex Networks. https://arxiv.org/abs/2609.39377
Cite the original work for its findings. Save a collection to share your selection of sources.