Year: 2026
Type: preprint
Abstract: Many real systems can be represented as growing networks where new nodes and links gradually emerge. The Barabási-Albert model for growing networks, and many models inspired by it, are based on the idea that nodes compete for links. However, the strength and the very presence of this competition have not been tested. We propose a robust statistical approach to quantify how strongly nodes compete for links, and apply it to data from various real systems---commenting on online news and cinema attendance data. We find a range of possible behaviors, from the perfectly elastic case, where new entrants shape network growth in a way that leaves the rest of the system unaffected, to an intermediate case where new entrants measurably affect the rest. Perfect competition is never observed. These findings have direct implications for complex systems modeling and e-commerce applications.
Source: arXiv (Cornell University)
Authors: Medo, Matúš, Rozanova, Liudmila
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214730820
