Fixed-Size Dynamic Scale-Free Networks: Modeling, Stationarity, and Resilience

Read full text
Authors: Yichao Yao, Minyu Feng, Matjaž Perc, J. Kurths
Cited by: 3
References: 32

Abstract

Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the node count remains constant, instead prioritizing node growth. In this work, we depart from the assumptions of node number variation and preferential attachment to present an innovative model that conceptualizes node degree fluctuations as a state-dependent random walk process with stasis and variable diffusion coefficient. We show that this model yields stochastic dynamic networks with stable scale-free properties. Through comprehensive theoretical and numerical analyses, we demonstrate that the degree distribution converges to a power-law distribution, provided that the lowest degree state within the network is not an absorbing state. Furthermore, we investigate the resilience of the fraction of the largest component and the average shortest path length following deliberate attacks on the network. By using three real-world networks, we confirm that the proposed model accurately replicates actual data. The proposed model thus elucidates mechanisms by which networks, devoid of growth and preferential attachment features, can still exhibit power-law distributions and be used to simulate and study the resilience of attacked fixed-size scale-free networks.

Fields of Study & Subjects

Complex Network Analysis Techniques Advanced Graph Neural Networks Opinion Dynamics and Social Influence

Publication details

Journal / source
IEEE Transactions on Systems Man and Cybernetics Systems
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
56
Issue
4
Pages
2570–2582
Publication date
12 January 2026
Language
EN