Understanding Stability of Noisy Networks through Centrality Measures and Local Connections
Vladimir Ufimtsev, Soumya Sarkar, Animesh Mukherjee, Sanjukta Bhowmick

TL;DR
This study investigates how small structural changes in real-world networks influence the stability of high centrality vertices, revealing that local connections and clustering significantly impact stability more than global network properties.
Contribution
The paper introduces a method to assess network stability based on local properties of high centrality vertices, without needing explicit noise modeling.
Findings
Network stability depends on the number of top-ranked vertices considered.
Vertices tend to stay within their centrality clusters despite perturbations.
High stability occurs when top vertices are densely connected.
Abstract
Networks created from real-world data contain some inaccuracies or noise, manifested as small changes in the network structure. An important question is whether these small changes can significantly affect the analysis results. In this paper, we study the effect of noise in changing ranks of the high centrality vertices. We compare, using the Jaccard Index (JI), how many of the top-k high centrality nodes from the original network are also part of the top-k ranked nodes from the noisy network. We deem a network as stable if the JI value is high. We observe two features that affect the stability. First, the stability is dependent on the number of top-ranked vertices considered. When the vertices are ordered according to their centrality values, they group into clusters. Perturbations to the network can change the relative ranking within the cluster, but vertices rarely move from one…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
