Local Community Detection in Dynamic Graphs Using Personalized Centrality

Analyzing massive graphs poses challenges due to the vast amount of data available. Extracting smaller relevant subgraphs allows for further visualization and analysis that would otherwise be too computationally intensive. Furthermore, many real data sets are constantly changing, and require algorithms to update as the graph evolves. This work addresses the topic of local community detection, or seed set expansion, using personalized centrality measures, specifically PageRank and Katz centrality. We present a method to efficiently update local communities in dynamic graphs. By updating the personalized ranking vectors, we can incrementally update the corresponding local community. Applying our methods to real-world graphs, we are able to obtain speedups of up to 60× compared to static recomputation while maintaining an average recall of 0.94 of the highly ranked vertices returned. Next, we investigate how approximations of a centrality vector affect the resulting local community. Specifically, our method guarantees that the vertices returned in the community are the highly ranked vertices from a personalized centrality metric.

[1]  Cleve B. Moler,et al.  Iterative Refinement in Floating Point , 1967, JACM.

[2]  C. D. Meyer,et al.  Updating the stationary vector of an irreducible Markov chain , 2002 .

[3]  Ulrik Brandes,et al.  Centrality Estimation in Large Networks , 2007, Int. J. Bifurc. Chaos.

[4]  Alexander Struck,et al.  Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels , 2010, ArXiv.

[5]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[6]  David A. Bader,et al.  Graph Ranking Guarantees for Numerical Approximations to Katz Centrality , 2017, ICCS.

[7]  David A. Bader,et al.  A Dynamic Algorithm for Updating Katz Centrality in Graphs , 2017, ASONAM.

[8]  Deepayan Chakrabarti,et al.  Evolutionary clustering , 2006, KDD '06.

[9]  Erik M Bollt,et al.  Local method for detecting communities. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Amy Nicole Langville,et al.  Updating pagerank with iterative aggregation , 2004, WWW Alt. '04.

[11]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[12]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[13]  Sreenivas Gollapudi,et al.  Estimating PageRank on graph streams , 2008, PODS.

[14]  Torsten Suel,et al.  Local methods for estimating pagerank values , 2004, CIKM '04.

[15]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Jon M. Kleinberg,et al.  Block models and personalized PageRank , 2016, Proceedings of the National Academy of Sciences.

[18]  Ashish Goel,et al.  Fast Incremental and Personalized PageRank , 2010, Proc. VLDB Endow..

[19]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[20]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[21]  Fergal Reid,et al.  Detecting highly overlapping community structure by greedy clique expansion , 2010, KDD 2010.

[22]  Jean-Loup Guillaume,et al.  Static community detection algorithms for evolving networks , 2010, 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks.

[23]  Christos Faloutsos,et al.  R-MAT: A Recursive Model for Graph Mining , 2004, SDM.

[24]  Michele Benzi,et al.  A matrix analysis of different centrality measures , 2013, ArXiv.

[25]  Tanya Y. Berger-Wolf,et al.  A framework for community identification in dynamic social networks , 2007, KDD '07.

[26]  Cheng Wu,et al.  A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks , 2014, ArXiv.

[27]  Dorothea Wagner,et al.  Dynamic graph clustering combining modularity and smoothness , 2013, JEAL.

[28]  Renaud Lambiotte,et al.  Line graphs of weighted networks for overlapping communities , 2010 .

[29]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[30]  Ying Xuan,et al.  Towards social-aware routing in dynamic communication networks , 2009, 2009 IEEE 28th International Performance Computing and Communications Conference.

[31]  Carl D. Meyer,et al.  Updating pagerank using the group inverse and stochastic complementation , 2002 .

[32]  David A. Bader,et al.  588 Graph Partitioning and Graph Clustering , 2013 .

[33]  Xiaoming Liu,et al.  SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[34]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[35]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  T. Vicsek,et al.  Clique percolation in random networks. , 2005, Physical review letters.

[37]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[38]  Christian Staudt,et al.  Engineering Parallel Algorithms for Community Detection in Massive Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[39]  Peter Grindrod,et al.  Non-backtracking walk centrality for directed networks , 2018, J. Complex Networks.

[40]  Hector Garcia-Molina,et al.  Combating Web Spam with TrustRank , 2004, VLDB.

[41]  David A. Bader,et al.  Detecting Communities from Given Seeds in Social Networks , 2011 .

[42]  David A. Bader,et al.  Multithreaded Community Monitoring for Massive Streaming Graph Data , 2013, 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum.

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

[44]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[45]  Amy Nicole Langville,et al.  Updating Markov Chains with an Eye on Google's PageRank , 2005, SIAM J. Matrix Anal. Appl..

[46]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[47]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[48]  E. Jason Riedy,et al.  Updating PageRank for Streaming Graphs , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).

[49]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

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

[51]  Yun Chi,et al.  Analyzing communities and their evolutions in dynamic social networks , 2009, TKDD.

[52]  Céline Robardet,et al.  Communities detection and analysis of their dynamics in collaborative networks , 2007, 2007 2nd International Conference on Digital Information Management.