Centrality measures such as degree or betweenness are standard tools for picking out important nodes in a network. But they always produce a ranking, even when the observed differences between nodes are nothing more than ordinary structural variation. A new preprint on arXiv argues that this is a problem: rankings can imply a meaningful center where none actually exists.
The authors propose stepping back and asking a prior question: does the network contain a statistically identifiable central structure? Instead of immediately computing centrality scores, their approach tests whether the network's pattern is distinguishable from what would arise by chance. Only if such a structure is detected would ranking nodes by centrality be justified.
This shifts the focus from "who is most central?" to "is there a center at all?" The work is a methodological caution, reminding researchers that a ranking is not evidence of hierarchy. As a single preprint, the claims have not yet been peer-reviewed, but the question it raises is directly relevant to any field that relies on network centrality.
The preprint is available on arXiv under the title "Testing Central Structure for Complex Networks."