Predicting Node Degree Centrality with the Node Prominence Profile
Yang Yang, Yuxiao Dong, Nitesh V. Chawla

TL;DR
This paper introduces a method combining preferential attachment and triadic closure to predict future degree centrality of nodes in social networks, revealing early-stage signatures that forecast their importance.
Contribution
It proposes the node prominence profile, a novel approach that effectively predicts future degree centrality by capturing a node's prominence in evolving social networks.
Findings
The method accurately predicts future degree centrality across multiple social networks.
Early-stage nodes exhibit distinctive signatures in their degree centrality trends.
The prominence profile outperforms traditional centrality measures in prediction tasks.
Abstract
Centrality of a node measures its relative importance within a network. There are a number of applications of centrality, including inferring the influence or success of an individual in a social network, and the resulting social network dynamics. While we can compute the centrality of any node in a given network snapshot, a number of applications are also interested in knowing the potential importance of an individual in the future. However, current centrality is not necessarily an effective predictor of future centrality. While there are different measures of centrality, we focus on degree centrality in this paper. We develop a method that reconciles preferential attachment and triadic closure to capture a node's prominence profile. We show that the proposed node prominence profile method is an effective predictor of degree centrality. Notably, our analysis reveals that individuals in…
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.
