mlsanityData to 14 Oct 2026

Testing Central Structure for Complex Networks

arXiv 2610.15659 ↗First posted 11 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Centrality measures rank nodes even when the observed differences can be explained by ordinary structural variation. We therefore study a preceding question: whether a network contains a statistically identifiable central structure at all. We formulate this question as a network-level hypothesis testing issue using the adjacency spectral radius as the test statistic and estimate an empirical p-value from randomized networks generated under a specified null model. The framework is evaluated using G(N,M), Chung-Lu, and two implementations of the configuration model on simulated benchmarks and 55 real networks. Controlled experiments further vary the number and connection weights of designated central nodes while holding network size and density fixed. The results show a clear negative association between central-structure strength and the empirical p-value. They also demonstrate that rejection decisions depend substantially on the structural properties preserved by the null model: the detected network sets are not simply nested across models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 20 references that are in the map. First posted on arXiv 11 Oct 2026.

Builds on

4 of 20 references.

References · 4

  1. 2015Influence maximization in complex networks through optimal percolationcited by 21
  2. 2016Vital nodes identification in complex networkscited by 16
  3. 2016Configuring Random Graph Models with Fixed Degree Sequencescited by 16
  4. 2025Critical Nodes Identification in Complex Networks: A Surveycited by 2

Built on by

Not cited yet.