Finding the most prominent group in complex networks

AI Communications

Volumn 20, Issue 4, 2007, Pages 287-296

  Puzis, Rami ^a   Elovici, Yuval ^a   Dolev, Shlomi ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Complex networks; Group betweenness centrality; Heuristic search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; RANDOM PROCESSES;

COMPLEX NETWORKS; GROUP BETWEENNESS CENTRALITY; HEURISTIC SEARCH; NETWORK SERVICE;

LARGE SCALE SYSTEMS;

EID: 36048936652     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (28)

1. S.H. Strogatz, Exploring complex networks, Nature 410 (2001), 268-276.
2. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, Cambridge University Press, Cambridge, 1994.
3. J. Scott, Social Network Analysis: A Handbook, Sage Publications, London, 2000.
4. P. Bork, L.J. Jensen, C. von Mering, A.K. Ramani, I. Lee and E.M. Marcotte, Protein interaction networks from yeast to human, Curr. Opin. Struct. Biol. 14(3) (2004), 292-299.
5. M. Faloutsos, P. Faloutsos and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM Comput. Comm. Rev. 29(4) (1999), 251-262.
6. S.-H. Yook, H. Jeong and A.-L. Barabasi, Modeling the internet's large-scale topology, PNAS 99(21) (2002), 13382-13386.
7. A.-L. Barabasi and R. Albert, Emergence of scaling in random networks, Science 286 (1999), 509-512.
8. A.-L. Barabasi, R. Albert and H. Jeong, Scale-free characteristics of random networks: the topology of the world-wide web, Physica A 281 (2000), 69-77.
9. B. Bollobas and O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Mathematics 1(1) (2003), 1-35.
10. M. Barthélemy, Betweenness centrality in large complex networks, The European Physical Journal B - Condensed Matter 38(2) (2004), 163-168.
11. C. Ballester, A. Calvó-Armengol and Y. Zenou, Who's who in networks, wanted: The key player, Econometrica 74(5) (2006), 1403-1417.
12. S.P. Borgatti, Identifying sets of key players in a social network, Comput. Math. Organ. Theory 12(1) (2006), 21-34.
13. L.C. Freeman, A set of measures of centrality based on betweenness, Sociometry 40(1) (1997), 35-41.
14. J.M. Anthonisse, The rush in a directed graph, Technical report BN 9/71, Stichting Mathematisch Centrum, Amsterdam, 1971.
15. P. Holme, Congestion and centrality in traffic flow on complex networks, Advances in Complex Systems 6(2) (2003), 163-176.
16. G. Yan, T. Zhou, B. Hu, Z.-Q. Fu and B.-H. Wang, Efficient routing on complex networks, Phys. Rev. E 73 (2006), 046108.
17. M.G. Everett and S.P. Borgatti, The centrality of groups and classes, Mathematical Sociology 23(3) (1999), 181-201.
18. V. Yegneswaran, P. Barford and S. Jha, Global intrusion detection in the domino overlay system, in: NDSS, San Diego, CA, 2004.
19. D.H. Zanette and M. Kuperman, Effects of immunization in small-world epidemics, Physica A 309 (2002), 445-452.
20. K. Park, Scalable protection against ddos and worm attacks, DARPA ATO FTN project AFRL contract F30602-01-2-0530, Purdue University, West Lafayette, 2004.
21. L.C. Freeman, S.P. Borgatti and D.R. White, Centrality in valued graphs: A measure of betweenness based on network flow, Social Networks 13(2) (1991), 141-154.
22. M.E.J. Newman, A measure of betweenness centrality based on random walks, Social Networks 27(1) (2005), 39-54.
23. R.G. Downey and M.R. Fellows, Parametrized Computational Feasibility, Birkhäuser, Boston, 1995, pp. 219-244.
24. R. Puzis, Y. Elovici and S. Dolev, Fast algorithm for successive group betweenness centrality computation, Technical report #03-07, Dept. of Computer Science, Ben Gurion University of the Negev, Jan. 2007.
25. R.E. Korf and W. Zhang, Performance of linear-space search algorithms, Artificial Intelligence 79(2) (1995), 241-292.
26. M.E.J. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Phys. Rev. E 64 (2001), 016132.
27. M.E.J. Newman, Erratum: Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Phys. Rev. E 73 (2006), 039906(E).
28. U. Brandes, A faster algorithm for betweenness centrality, Mathematical Sociology 25(2) (2001), 163-177.