Predicting Node Degree Centrality with the Node Prominence Profile

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 the early stage of evolution display a distinctive and robust signature in degree centrality trend, adequately predicted by their prominence profile. We evaluate our work across four real-world social networks. Our findings have important implications for the applications that require prediction of a node's future degree centrality, as well as the study of social network dynamics.

[1]  Jon M. Kleinberg,et al.  Feedback effects between similarity and social influence in online communities , 2008, KDD.

[2]  Mark S. Granovetter.  The Strength of Weak Ties , 1973, American Journal of Sociology.

[3]  N. Graham,et al.  Areas beneath the relative operating characteristics (ROC) and relative operating levels (ROL) curves: Statistical significance and interpretation , 2002 .

[4]  Jennifer Neville,et al.  Modeling relationship strength in online social networks , 2010, WWW '10.

[5]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[6]  Z. Di,et al.  Emergence of global preferential attachment from local interaction , 2009, 0910.0103.

[7]  Cecilia Mascolo,et al.  Exploiting place features in link prediction on location-based social networks , 2011, KDD.

[8]  M. Newman.  Power laws, Pareto distributions and Zipf's law , 2005 .

[9]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[10]  Bo Zhao,et al.  Probabilistic topic models with biased propagation on heterogeneous information networks , 2011, KDD.

[11]  Philip S. Yu,et al.  Identifying the influential bloggers in a community , 2008, WSDM '08.

[12]  Daniel W. Apley,et al.  Image denoising with a multi-phase kernel principal component approach and an ensemble version , 2011, 2011 IEEE Applied Imagery Pattern Recognition Workshop (AIPR).

[13]  Mark Goadrich,et al.  The relationship between Precision-Recall and ROC curves , 2006, ICML.

[14]  Matteo Marsili,et al.  The rise and fall of a networked society: a formal model. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[16]  M Girvan,et al.  Structure of growing social networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Charu C. Aggarwal,et al.  When will it happen?: relationship prediction in heterogeneous information networks , 2012, WSDM '12.

[18]  P. Holland,et al.  An Exponential Family of Probability Distributions for Directed Graphs , 1981 .

[19]  Jure Leskovec,et al.  Microscopic evolution of social networks , 2008, KDD.

[20]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[21]  Kun Li,et al.  A coevolving model based on preferential triadic closure for social media networks , 2013, Scientific Reports.

[22]  Jari Saramäki,et al.  A comparative study of social network models: Network evolution models and nodal attribute models , 2008, Soc. Networks.

[23]  Robert C. Wolpert,et al.  A Review of the , 1985 .

[24]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[25]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[26]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[27]  Richard Rothenberg,et al.  Choosing a centrality measure: Epidemiologic correlates in the Colorado Springs study of social networks☆ , 1995 .

[28]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[29]  Pang-Ning Tan,et al.  Measuring the effects of preprocessing decisions and network forces in dynamic network analysis , 2009, KDD.

[30]  Thilo Gross,et al.  Adaptive coevolutionary networks: a review , 2007, Journal of The Royal Society Interface.

[31]  Tom Fawcett,et al.  ROC Graphs: Notes and Practical Considerations for Researchers , 2007 .

[32]  Terry Patten,et al.  The formal model , 1988 .

[33]  P. Holland,et al.  TRANSITIVITY IN STRUCTURAL MODELS OF SMALL GROUPS , 1977 .

[34]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[35]  R. Burt,et al.  Applied Network Analysis: A Methodological Introduction , 1983 .

[36]  Stefan Thurner,et al.  Triadic closure dynamics drives scaling laws in social multiplex networks , 2013, 1301.0259.

[37]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[38]  Stefan Bornholdt,et al.  Emergence of a small world from local interactions: modeling acquaintance networks. , 2002, Physical review letters.

[39]  R. Engle.  Wald, likelihood ratio, and Lagrange multiplier tests in econometrics , 1984 .

[40]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[41]  F. Heider.  The psychology of interpersonal relations , 1958 .

[42]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[43]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[44]  Nitesh V. Chawla,et al.  Link Prediction: Fair and Effective Evaluation , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[45]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[46]  E. Katz.  The Two-Step Flow of Communication: An Up-To-Date Report on an Hypothesis , 1957 .

[47]  Nitesh V. Chawla,et al.  New perspectives and methods in link prediction , 2010, KDD.

[48]  Cynthia M. Lakon,et al.  How Correlated Are Network Centrality Measures? , 2008, Connections.

[49]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[50]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[51]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[52]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[53]  Nitesh V. Chawla,et al.  Vertex collocation profiles: subgraph counting for link analysis and prediction , 2012, WWW.

[54]  Jie Tang,et al.  Learning to predict reciprocity and triadic closure in social networks , 2013, TKDD.

[55]  Lisa Singh,et al.  Finding Prominent Actors in Dynamic Affiliation Networks , 2012 .

[56]  Huan Liu,et al.  Relational learning via latent social dimensions , 2009, KDD.

[57]  Nitesh V. Chawla,et al.  Link Prediction and Recommendation across Heterogeneous Social Networks , 2012, 2012 IEEE 12th International Conference on Data Mining.

[58]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .