A framework for the evaluation and management of network centrality

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 427-438

  Ishakian, Vatche ^a   Erdos, Dora ^a   Terzi, Evimaria ^a   Bestavros, Azer ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK MANAGEMENT; SPACE DIVISION MULTIPLE ACCESS;

CENTRALITY MEASURES; EXPERIMENTAL EVALUATION; NETWORK CENTRALITIES; OPTIMIZATION PROBLEMS;

DATA MINING;

EID: 84880250687     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.37     Document Type: Conference Paper

References (20)

1. J. M. Anthonisse. The rush in a directed graph. SMC, 1971.
2. S. P. Borgatti. Centrality and network flow. Social Networks, 27:55-71, Jan. 2005.
3. U. Brandes. A faster algorithm for betweenness cen- Trality. Journal of Mathematical Sociology, 25:163-177, 2001.
4. U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. Social Net- works, 30(2):136- 145, 2008.
5. U. Brandes and D. Fleischer. Centrality measures based on current flow. In STACS'05, pages 533-544, 2005.
6. S. Dolev, Y. Elovici, R. Puzis, and P. Zilberman. Incremental deployment of network monitors based on group betweenness centrality. Inf. Process. Lett., 109, September 2009.
7. M. Everett and S. Borgatti. Extending centrality. Models and methods in social network analysis, pages 57-76, 2005.
8. M. G. Everett and S. P. Borgatti. The centrality of groups and classes. The Journal of Mathematical Sociology, 23:181-201, 1999.
9. M. Fink and J. Spoerhase. Maximum betweenness cen- Trality: Approximability and tractable cases. WAL- COM: Algorithms and Computation, pages 9-20, 2011.
10. L. C. Freeman. A Set of Measures of Centrality Based on Betweenness. Sociometry, 40(1):35-41, Mar. 1977.
11. K.-I. Goh, B. Kahng, and D. Kim. Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett., Dec 2001.
12. W. Hwang, Yrae Cho, A. Zhang, and M. Ramanathan. Bridging centrality: Identifying bridging nodes in scale- free networks. Technical report, 2006.
13. V. Ishakian, D. Erdos, E. Terzi, and A. bestavros. A framework for the evaluation and management of network centrality. Technical Report BUCS-2011-022, CS Department, Boston University, October 2011.
14. H. Kwak, C. Lee, H. Park, and S. Moon. What is Twitter, a social network or a news media? In ACM WWW '10, pages 591-600, New York, NY, USA, 2010.
15. J. Leskovec, L. Backstrom, and J. Kleinberg. Meme- Tracking and the dynamics of the news cycle. In 15th ACM SIGKDD, 2009.
16. G. Nemhauser, L. Wolsey, and M. Fisher. Ananaly- sis of approximations for maximizing submodular set functions. Math. Prog., 14:265-294, 1978.
17. M. E. J. Newman. A measure of betweenness centrality based on random walks. Social Networks, 27, 2005.
18. J. J. Pfeier III and J. Neville. Probabilistic Paths and Centrality in Time. 2010.
19. R. Puzis. Group betweenness centrality: Efficient computations and applications. 2008.
20. A. Shimbel. Structural parameters of communication networks. Bulletin of Mathematical Biology, 15:501-507, 1953.