An incremental algorithm for updating betweenness centrality and k-betweenness centrality and its performance on realistic dynamic social network data

Social Network Analysis and Mining

Volumn 4, Issue 1, 2014, Pages 1-23

  Kas, Miray ^a,b   Carley, Kathleen M ^b   Carley, L Richard ^b  

^a GOOGLE INC   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

All pairs shortest paths; Betweenness centrality; Dynamic network analysis; Incremental algorithms; k Betweenness centrality

Indexed keywords

ALL PAIRS SHORTEST PATHS; BETWEENNESS CENTRALITY; CENTRALITY MEASURES; DYNAMIC CALCULATIONS; DYNAMIC NETWORK ANALYSIS; DYNAMIC SOCIAL NETWORKS; INCREMENTAL ALGORITHM; ORDERS OF MAGNITUDE;

DIGITAL STORAGE;

EID: 84938369844     PISSN: 18695450     EISSN: 18695469     Source Type: Journal    
DOI: 10.1007/s13278-014-0235-z     Document Type: Article

References (47)

1. Bader D, Madduri K (2006) Parallel algorithms for evaluating centrality indices in real-world networks. International conference on parallel processing (ICPP). IEEE, pp 539–550
2. Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512
3. Batagelj V, Kejžar N, Korenjak-Černe S, Zaveršnik M (2006). Analyzing the structure of US patents network. Springer, Berlin
4. Berman AM (1992) Lower and upper bounds for incremental algorithms. Ph.D. Dissertation, The State University of New Jersey at Rutgers, Computer Science, New Brunswick
5. Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Soc Netw 28(4):466–484
6. Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163–177
7. Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Soc Netw 30(2):136–145
8. Demetrescu C, Italiano GF (2004) A new approach to dynamic all pairs shortest paths. J ACM (JACM) 51(6):968–992
9. Demetrescu C, Italiano GF (2006) Experimental analysis of dynamic all pairs shortest path algorithms. ACM Trans Algorithms (TALG) 2(4):578–601
10. Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271
11. Even S, Gazit H (1985) Updating distances in dynamic graphs. Methods Oper Res 49:371–387
12. Floyd R (1962) Algorithm 97: shortest path. Commun ACM 5(6):345
13. Fredman ML, Tarjan RE (1984). Fibonacci heaps and their uses in improved network optimization algorithms. 25th annual symposium on foundations of computer science. IEEE, pp 338–346
14. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35–41
15. GraphStream Team (2010) GraphStream. Retrieved 3 February 2012. http://graphstream-project.org/
16. Green O, McColl R, Bader DA (2012). A fast algorithm for streaming betweenness centrality. International Conference on Privacy, Security, Risk and Trust (PASSAT) and International Conference on Social Computing (SocialCom). IEEE, Amsterdam, pp 11–20
17. Gringoli FE (2009) GT: picking up the truth from the ground for internet traffic. Comput Commun Rev 39(5):13–18
18. Habiba H, Tantipathananandh C, Berger-Wolf T (2007) Betweenness centrality measure in dynamic networks. University of Illinois at Chicago, Department of Computer Science. DIMACS, Chicago
19. Isella LE (2011) What’s in a crowd? Analysis of face-to-face behavioral networks. J Theor Biol 271(1):166–180
20. Jiang K, Ediger D, Bader DA (2009) Generalizing k-betweenness centrality using short paths and a parallel multithreaded implementation. International conference on parallel processing (ICPP), Vienna, pp 542–549
21. Kas M (2013b) Incremental centrality algorithms for dynamic network analysis. Ph.D. Dissertation, Carnegie Mellon University, ECE, Pittsburgh
22. Kas M, Wachs M, Carley L, Carley K (2012a). Incremental centrality computations for dynamic social networks. XXXII international sunbelt social network conference (Sunbelt 2012). INSNA, Redondo Beach
23. Kas M, Carley KM, Carley LR (2012b) Trends in science networks: understanding structures and statistics of scientific networks. Social network analysis and mining (SNAM)
24. Kas M, Wachs M, Carley K, Carley L (2013) incremental algorithm for updating betweenness centrality in dynamically growing networks. The 2013 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM). IEEE, Niagara Falls
25. Kim H, Anderson R (2012) Temporal node centrality in complex networks. Phys Rev E 85(026107):1–8
26. King, V. (1999). Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. 40th annual symposium on foundations of computer science. IEEE, pp 81–89
27. Kourtellis N, Alahakoon T, Simha R, Iamnitchi A, Tripathi R (2013) Identifying high betweenness centrality nodes in large social networks. Soc Netw Anal Min (SNAM) 4(3):899–914
28. Lee MJ, Lee J, Park JY, Choi R, Chung CW (2012a) QUBE: a Quick algorithm for updating BEtweenness centrality. WWW, ACM, pp 351–360
29. Lee MJ, Lee J, Park JY, Choi R, Chung CW (2012b) QUBE: a quick algorithm for updating BEtweenness centrality. In: Proceedings of the 21st international conference on World Wide Web (WWW). ACM, Lyon, pp 351–360
30. Lerman K, Ghosh R, Kang JH (2010) Centrality metric for dynamic networks. 8th workshop on mining and learning with graphs (MLG). ACM, pp 70–77
31. Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans KDD 1(2):1–41
32. Leskovec J, Huttenlocher DP, Kleinberg JM (2010) Governance in social media: a case study of the Wikipedia promotion process. The international AAAI conference on weblogs and social media (ICWSM)
33. Liao W, Ding J, Marinazzo D, Xu Q, Wang Z, Yuan C et al (2011) Small-world directed networks in the human brain: multivariate Granger causality analysis of resting-state fMRI. Neuroimage 54(4):2683–2694
34. Norlen K, Lucas G, Gebbie M, Chuang J (2002) EVA: extraction, visualization and analysis of the telecommunications and media ownership network. International telecommunications society 14th biennial conference
35. Onnela JP, Saramäki J, Hyvönen J, Szabó G, Lazer D, Kaski K et al (2007) Structure and tie strengths in mobile communication networks. Proc Natl Acad Sci 104(18):7332–7336
36. Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Soc Netw 31(2):155–163
37. Pfeffer J, Carley KM (2012) k-Centralities: local approximations of global measures based on shortest paths. WWW. ACM, pp 1043–1050
38. Puzis R, Zilberman P, Elovici Y, Dolev S, Brandes U (2012) Heuristics for speeding up betweenness centrality computation. Social computing and on privacy, security, risk and trust. IEEE Computer Society, pp 302–311
39. Ramalingam G, Reps T (1991a) On the computational complexity of incremental algorithms. Technical report, University of Wisconsin at Madison
40. Ramalingam G, Reps T (1991b) On the computational complexity of incremental algorithms. Technical Report, University of Wisconsin at Madison, Computer Science, Madison
41. Ramezanpour A, Karimipour V (2008) Simple models of small world networks with directed links. Sharif University of Technology, Department of Physics, Tehran
42. Renyi A, Erdos P (1959). On random graphs. Publicationes Mathematicae, 6
43. Tang J, Musolesi M, Mascolo C, Latora V, Nicosia V (2010) Analysing information flows and key mediators through temporal centrality metrics. 3rd workshop on social network systems (SNS). April
44. Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440–442
45. Xu J (2008) Markov chain small world model with asymmetric transition probabilities. Electron J Linear Algebra 17:616–636
46. Yang J, Leskovec J (2011). Patterns of temporal variation in online media. International conference on web search and data minig (WSDM). ACM
47. Zhu C, Xiong S, Tian Y, Li N, Jiang K (2004). Scaling of directed dynamical small-world networks with random responses. Phys Rev Lett 92 218702(24):1–4