Aug 2026· Chaos· Vol 36 8· 0 citations· 31 references
Medicine
Abstract
The analysis of random walks on networks often relies on global quantities that average over nodes, thereby masking local differences in diffusion speed. This study introduces a vertex-level quantity Hi, defined as the finite-window fitted scaling exponent of the mean squared resistance distance ⟨Ωi2(t)⟩∼Cit2Hi from a given node i. We found nodes with Hi values below 0.5 (echo effect) and above 0.5 (catapult effect). The exponent is computed exactly via matrix powers of the transition matrix. We systematically evaluate Hi on several synthetic network families, generalized Sierpiński graphs, Newman-Watts small-world networks, and a custom grid-path-complete graph, and on two real-world networks (international E-road network and western U.S. power grid). We found nodes with Hi values less than 0.5 (subdiffusive regime) and greater than 0.5 (apparent superdiffusion) in both model networks and real-world networks. Analysis of model networks shows that when a node has an echo effect, its Hi value is less than 0.5, whereas when it has a catapult effect, its Hi value is greater than 0.5. In the two real networks, most nodes are in the subdiffusive regime and the overall heterogeneity of the local diffusion exponents is low, as indicated by Rényi indices of 0.0835 (E-road network) and 0.0555 (power grid). Comparisons with classical centrality measures indicate that Hi provides information not captured by those measures. The local diffusion exponent offers a vertex-level, dynamics-based tool for identifying structural bottlenecks and node roles, complementing global network characterizations.
Predicting the percolation threshold of highly clustered networks from local statistics remains difficult, because short loops break the independence assumption underlying tree-like message passing. Existing remedies address loopy connectivity either through prescribed local motifs in random-graph ensembles or through...
Functional laws of large numbers (FLLNs) describe the mean-field trajectory of epidemics on networks, but say nothing about the fluctuations around it. These fluctuations are governed by moments of the degree distribution not relevant at the level of the mean. A rigorous functional central limit theorem (FCLT) exists f...
Lucija Nora Farkavs, Sebastian Morel Balbi, Hrvoje vStefanvci'c et al.· 0 citations
The results show that smaller clusters are generally more vulnerable to attacks on central nodes, whereas larger and less centralized clusters retain more topological efficiency.
Random walks with long-range jumps can drive superdiffusive transport, replacing ordinary diffusion with an effective long-range kinetic operator. Such superdiffusive kinetics is also central to critical phenomena, notably the self-avoiding walk with long-range jump statistics, or L\'evy-SAW. This work investigates how...
Adding links generally improves classical transport by increasing the number of available paths. We show that coherent quantum transport can display the opposite behavior. Using continuous-time quantum walks on a percolated hierarchical small-world network, we identify a coherent overconnectivity penalty: root-to-bound...
This work proposes a community-based preferential attachment hypergraph model with tunable modularity and a heavy-tailed degree distribution, reproducing key structural properties in real systems, and develops a hypergraph-based SAIR framework to describe epidemic dynamics with asymptomatic transmission.
Jialin Bi, Ning-Han Sun· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.