Centrality estimation in large networks

International Journal of Bifurcation and Chaos

Volumn 17, Issue 7, 2007, Pages 2303-2318

  Brandes, Ulrik ^a   Pich, Christian ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Approximate computation; Betweenness centrality; Complex networks

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; MOTION PLANNING; NUMBER THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

APPROXIMATE COMPUTATIONS; BETWEENNESS CENTRALITY; COMPLEX NETWORKS;

LARGE SCALE SYSTEMS;

EID: 34548506301     PISSN: 02181274     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218127407018403     Document Type: Article

References (32)

1. Anthonisse, J. M. [1971] "The rush in a directed graph," Technical Report BN 9/71, Stichting Mathematisch Centrum, 2e Boerhaavestraat 49 Amsterdam.
2. Barabási, A.-L. & Albert, R. [1999] "Emergence of scaling in random networks," Science 286, 509-512.
3. Batagelj, V. & Brandes, U. [2005] "Efficient generation of large random networks," Phys. Rev. E 71 (036113).
4. Baumann, N. & Stiller, S. [2005] "Network models," in Network Analysis, eds. Brandes, U. & Erlebach, T., pp. 341-372.
5. Beauchamp, M. A. [1965] "An improved index of centrality," Behav. Sci. 10, 161-163.
6. Bollobás, B., Riordan, O. M., Spencer, J. & Tusnády, G. [2001] "The degree sequence of a scale-free random graph process," Rand. Struct. Algorith. 18, 279-290.
7. Bonacich, P. [1972] "Factoring and weighting approaches to status scores and clique identification," J. Math. Sodol. 2, 113-120.
8. Botafogo, R. A., Rivlin, E. & Shneiderman, B. [1992] "Structural analysis of hypertexts: Identifying hierarchies and useful metrics," ACM Trans. Inform. Syst. 10, 142-180.
9. Brandes, U. [2001] "A faster algorithm for betweenness centrality," J. Math. Sociol. 25, 163-177.
10. Brandes, U. & Erlebach, T. (eds.) [2005] Network Analysis, Lecture Notes in Computer Science, Vol. 3418 (Springer-Verlag).
11. Brandes, U. & Fleischer, D. [2005] "Centrality measures based on current flow," in Proc. 22nd Int. Symp. Theoretical Aspects of Computer Science (STACS'05), Lecture Notes in Computer Science, Vol. 3404, pp. 533-544.
12. Brin, S. & Page, L. [1998] "The anatomy of a large-scale hypertextual Web search engine," Comput. Netw. ISDN Syst. 30, 107-117.
13. Carpenter, T., Karakostas, G. & Shallcross, D. [2002] "Practical issues and algorithms for analyzing terrorist networks," Invited paper, Western Multi-Conf. (WMC 2002).
14. Corman, S. R., Kuhn, T., McPhee, R. D. & Dooley, K. J. [2002] "Studying complex discursive systems: Centering resonance analysis of communication," Human Commun. Res. 28, 157-206.
15. Eppstein, D. & Wang, J. [2004] "Fast approximation of centrality," J. Graph Algorith. Appl. 8, 39-45.
16. Erdos, P. & Rényi, A. [1959] "On random graphs I," Publ. Math. Debrecen 6, 290-297.
17. Freeman, L. C. [1977] "A set of measures of centrality based upon betweenness," Sodometry 40, 35-41.
18. Freeman, L. C., Borgatti, S. P. & White, D. R. [1991] "Centrality in valued graphs: A measure of betweenness based on network flow," Social Networks 13, 141-154.
19. Gilbert, E. N. [1959] "Random graphs," Ann. Math. Stat. 30, 1141-1144.
20. Harary, F. & Hage, P. [1995] "Eccentricity and centrality in networks," Social Networks 17, 57-63.
21. Hochbaum, D. S. & Shmoys, D. B. [1986] "A unified approach to approximation algorithms for bottleneck problems," J. Assoc. Comput. Mach. 33, 533-550.
22. Hoeffding, W. [1963] "Probability inequalities for sums of bounded random variables," J. Amer. Statist. Assoc. 58, 713-721.
23. Jeong, H., Mason, S. P., Barabási, A.-L. & Oltvai, Z. N. [2001] "Lethality and centrality in protein networks," Nature 411, 41-42, Brief communications.
24. Kleinberg, J. M. [1999] "Authoritative sources in a hyperlinked environment," J. ACM 46, 604-632.
25. Koschützki, D., Lehmann, K. A., Peeters, L., Richter, S., Tenfelde-Podehl, D. & Zlotowski, O. [2005a] "Centrality indices," in Networks Analysis, eds. Brandes, U. & Erlebach, T., pp. 16-61.
26. Koschützki, D., Lehmann, K. A., Tenfelde-Podehl, D. & Zlotowski, O. [2005b] "Advanced centrality concepts," in Network Analysis, eds. Brandes, U. & Erlebach, T., pp. 83-111.
27. Newman, M. E. J. [2005] "A measure of betweenness centrality based on random walks," Social Networks 27, 39-54.
28. Sabidussi, G. [1966] "The centrality index of a graph," Psychometrika 31, 581-603.
29. Shimbel, A. [1953] "Structural parameters of communication networks," Bull. Math. Biophys. 15, 501-507.
30. Thompson, S. K. [2002] Sampling, 2nd edition (John Wiley).
31. Valente, T. W., Foreman, R. K., Junge, B. & Vlahov, D. [1998] "Satellite exchange in the Baltimore needle exchange program," Public Health Rep. 113, 90-96.
32. Watts, D. J. & Strogatz, S. H. [1998] "Collective dynamics of 'small-world' networks," Nature 393, 440-442.