Incremental closeness centrality for dynamically changing social networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013

Volumn , Issue , 2013, Pages 1250-1258

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

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Closeness centrality; Dynamic all pair shortest path; Dynamic networks; Incremental algorithms

Indexed keywords

ALGORITHMS; DATA PROCESSING; GRAPH THEORY; SOCIAL SCIENCES COMPUTING;

ALL-PAIR SHORTEST PATH; CLOSENESS CENTRALITIES; DYNAMIC NETWORK; DYNAMIC SOCIAL NETWORKS; EFFICIENT COMPUTATION; INCREMENTAL ALGORITHM; INCREMENTAL UPDATES; ONLINE SOCIAL NETWORKINGS;

SOCIAL NETWORKING (ONLINE);

EID: 84893339265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492517.2500270     Document Type: Conference Paper

References (23)

1. P. Bonacich, "Power and centrality: A family of measures," American Journal of Sociology, vol. 92, no. 5, pp. 1170-1182, March 1987.
2. G. Sabidussi, "The centrality index of a graph," Psychometrika, vol. 31, no. 4, pp. 581-603, 1966.
3. L. C. Freeman, "A Set of Measures of Centrality based on Betweenness," Sociometry, pp. 35-41, 1977.
4. E. Dijkstra, "A note on two problems in connexion with graphs," Numerische mathematik, vol. 1, no. 1, pp. 269-271, 11 June 1959.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, 2nd Edition ed., Cambridge, MA: MIT Press, 2001, pp. 595- 601.
6. R. Floyd, "Algorithm 97: Shortest path," Communications of the ACM, vol. 5, no. 6, p. 345, June 1962.
7. S. Nanda and D. Kotz, "Social Network Analysis Plugin (SNAP) for Mesh Networks," in Wireless Communications and Networking Conference (WCNC), 2011.
8. U. Brandes, P. Kenis and D. Wagner, "Communicating Centrality in Policy Network Drawings," Transactions on Visualization and Computer Graphics, vol. 9, no. 2, pp. 241-253, 2003.
9. R. Yang and L. Zhuhadar, "Extensions of closeness centrality?," in Proceedings of the 49th Annual Southeast Regional Conference, Kennesaw, GA, 2011.
10. K. Okamoto, W. Chen and X. Y. Li, "Ranking of closeness centrality for large-scale social networks," in Proceedings of the 2nd International Frontiers of Algorithmics Workshop (FAW), Changsha, China, 2008.
11. D. Eppstein and J. Wang, "Fast approximation of centrality," in Proceedings of the twelfth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington, D.C., United States, 2001.
12. V. King, "Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs," in 40th Annual Symposium on Foundations of Computer Science, 1999.
13. G. Ramalingam and T. Reps, "On the Computational Complexity of Incremental Algorithms," Madison, 1991.
14. C. Demetrescu and G. F. Italiano, "Experimental Analysis of Dynamic All Pairs Shortest Path Algorithms," ACM Transactions on Algorithms (TALG), vol. 2, no. 4, pp. 578 - 601, 2006.
15. S. Even and H. Gazit, "Updating distances in dynamic graphs," Methods of Operations Research, vol. 49, pp. 371-387, 1985.
16. GraphStream Team, "GraphStream," 2010. [Online]. Available: http://graphstream-project.org/. [Accessed 3 February 2012].
17. A. Barabasi and R. Albert, "Emergence of Scaling in Random Networks," Science, vol. 286, no. 5439, pp. 509-512, 1999.
18. A. Renyi and P. Erdos, "On Random Graphs," Publicationes Mathematicae, vol. 6, 1959.
19. D. W. a. S. Strogatz, "Collective Dynamics of 'Small-World' Networks," Nature, vol. 393, 1998.
20. SocioPattern Project, "Hypertext 2009 Dynamic Contact Network Dataset," 2009. [Online]. Available: http://www.sociopatterns.org/datasets/ hypertext-2009-dynamic-contactnetwork/.
21. T. Opsahl and P. Panzarasa, "Clustering in weighted networks," Social Networks, vol. 31, no. 2, pp. 155-163, 2009.
22. UMass Amherst, "Dataset: Can-o-sleep," 21 May 2003. [Online]. Available: http://kdl.cs.umass.edu/proximity/index.html. [Accessed 21 April 2012].
23. M. Kas, K. M. Carley and L. R. Carley, "Trends in science networks: understanding structures and statistics of scientific networks," Social Network Analysis and Mining (SNAM), vol. 2, no. 2, pp. 169-187, 2012.