Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.33831

Resource competition and survival for random walkers on complex networks

Snehal Shekatkar
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

cs.SIphysics.comp-phstat.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Snehal Shekatkar. 2026-10-24. Resource competition and survival for random walkers on complex networks. https://arxiv.org/abs/2610.33831

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

GTIN: A Unified Scalable Framework for Joint Event and Time Prediction in Temporal Graphs

Temporal graphs are increasingly used to model dynamic systems across diverse domains, including social, financial, and traffic networks. Predicting both what the next event will be and when it will occur in these systems is crucial for understanding and anticipating complex behaviors, but has not been studied much yet, especially in large-scale graphs. To address this gap, we propose a scalable unified mathematical framework that captures varying degrees of complexity across temporal graphs with events occurring on the edges. Our framework is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics. Building upon this analysis, we introduce our novel scalable approach for jointly predicting the next event and its occurrence time. Empirical evaluations across multiple datasets demonstrate that our method consistently outperforms existing techniques, particularly in scenarios involving irregular event patterns and complex temporal dependencies. These findings highlight the potential of our framework as a robust foundation for future research in temporal event prediction.

cs.SI↗
arXiv2026

Investigating Forecasting Capabilities of Narrative Networks on Emerging Stories

Networks have been used to model the interactions among the elements that underlie a narrative. In this paper, we investigate whether the structure of these networks can predict which links will emerge as a storyline evolves. We construct these networks from news articles using a Semantic Edge Parser (SEP) built on a Large Language Model (LLM), and evaluate the networks on three disparate real-world storylines, the 2022 Canadian Freedom Convoy, Hurricane Melissa (2025), and the 2025-26 Iranian protests. To test the narrative network's predictive capability, we construct a rolling window of the narrative and predict the emergent links between existing narrative elements on the day following the rolling window period. We identify candidate links with seven standard link predictors, including the Adamic-Adar index, Common Neighbors, and Preferential Attachment. Forecasting next-day links across the three storylines, we find Preferential Attachment to be the strongest standard link predictor, achieving a mean ROC-AUC of 0.76-0.79. It exceeds EdgeBank, a memorization baseline, by 11.3-14.5 points on every event. To summarize, narrative-network structure ranks next-day emergent relations above chance, though this advantage is concentrated among the most frequently mentioned, highly connected entities.

cs.SI↗
arXiv2026

The Hidden Costs of Gatekeeping in Open Science: Quasi-Experimental Evidence from arXiv's Endorsement Policy Tightening

Preprint servers and open science platforms have become core infrastructure through which scientific knowledge circulates on the Web, greatly facilitating the dissemination and diffusion of online scientific information. Yet to safeguard content quality, many of these platforms rely on existing members to vouch for newcomers; how such network-mediated gatekeeping reshapes entry barriers across different scientific communities remains systematically underexplored. To address this, I examine the potential unequal impacts of this mechanism through arXiv's tightening of its endorsement policy in early 2026. Using the metadata of three million arXiv papers and the co-authorship networks of each research community, I compare the influx and dynamics of first-time submitters before and after the policy across eight disciplines. The findings show that the policy reduced the entry of new authors, and this reduction was concentrated in fields where co-authorship ties are sparse, while fields with dense collaboration networks were largely spared. A comparison with a parallel preprint server in biology suggests that this likely reflects a shift in where researchers choose to post rather than a decline in research activity. These findings demonstrate that the network structure of a scientific community shapes who can enter online scientific production, advancing our understanding of how the Web's open knowledge infrastructure shapes inequality in the diffusion of science.

cs.SI↗