Second order centrality: Distributed assessment of nodes criticity in complex networks

Computer Communications

Volumn 34, Issue 5, 2011, Pages 619-628

  Kermarrec, Anne Marie ^a   Le Merrer, Erwan ^b   Sericola, Bruno ^a   Trédan, Gilles ^c  

^a INRIA   (France)

^b Technicolor 1 ^*  (France)

^c TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Centralities; Random walk; Topologies

Indexed keywords

ANALYSIS AND SIMULATION; BETWEENNESS CENTRALITY; CENTRALITIES; COMPETITIVITY; COMPLEX NETWORKS; CRITICAL NODE; DEGREE CENTRALITY; DENSE CLUSTERS; KEYPOINTS; NETWORK SURVIVABILITY; NETWORK TOPOLOGY; OFFLINE; RANDOM WALK; RELATIVE IMPORTANCE; RETURN-TIMES; SECOND ORDER MOMENT; SECOND ORDERS; SOCIAL GRAPHS; SOCIAL INTERACTIONS; SOCIAL NETWORKS; STANDARD DEVIATION;

ELECTRIC NETWORK TOPOLOGY; RANDOM PROCESSES; RATING; STATISTICS; WIRELESS SENSOR NETWORKS;

GRAPH THEORY;

EID: 79751531116     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2010.06.007     Document Type: Article

References (35)

1. .
2. Serge Abiteboul, Mihai Preda, Gregory Cobena, Adaptive on-line page importance computation, in: WWW '03: Proceedings of the 12th International Conference on World Wide Web, New York, NY, USA, 2003, pp. 280-290.
3. R. Albert, and A.-L. Barabási Statistical mechanics of complex networks Rev. Mod. Phys. 74 2002 47 97
4. R. Albert, H. Jeong, and A.L. Barabási Error and attack tolerance of complex networks Nature 406 6794 2000 378 382 (Pubitemid 30625551)
5. David Aldous, James Allen Fill, Reversible Markov Chains and Random Walks on Graphs, 1995. < http://stat-www.berkeley.edu/users/aldous >.
6. Noga Alon, Chen Avin, Michal Koucky, Gady Kozma, Zvi Lotker, and Mark R. Tuttle Many random walks are faster than one SPAA '08: Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures 2008 ACM New York, NY, USA 119 128
7. Marc Barthelemy Betweenness centrality in large complex networks Eur. Phys. J. B 38 2004 163
8. P. Bonacich Factoring and weighting approaches to status scores and clique identification J. Math. Sociol. 2 1972 113 120
9. Ulrik Brandes A faster algorithm for betweenness centrality J. Math. Sociol. 25 2001 163 177 (Pubitemid 33398479)
10. Ulrik Brandes, and Christian Pich Centrality estimation in large networks Int. J. Bifurcat. Chaos 2007 2303 2318 (Pubitemid 47376632)
11. E. Cinlar Introduction to Stochastic Processes 1975 Prentice Hall New Jersey
12. Colin Cooper, and Alan Frieze The cover time of the preferential attachment graph J. Comb. Theory Ser. B 97 2 2007 269 290
13. L. DallAsta, A. Barrat, M. Barthelemy, and A. Vespignani Vulnerability of weighted networks J. Stat. Mech.: Theory Exp. 2006 2006 P04006
14. P. Erdös, A. Renyi, On random graphs, in: Publicationes Mathematicae, vol. 6, 1959, pp. 290-297.
15. Uriel Feige, A tight lower bound for the cover time of random walks on graphs, random structures and algorithms 6, in: Random Structures and Algorithms, 1995, pp. 433-438.
16. Uriel Feige A tight upper bound on the cover time for random walks on graphs RSA: Random Struct. Algor. 6 1995
17. Uriel Feige A fast randomized logspace algorithm for graph connectivity Theor. Comput. Sci. 169 2 1996 147 160 (Pubitemid 126413027)
18. Linton C. Freeman A set of measures of centrality based on betweenness Sociometry 40 1 1977 35 41
19. Ayalvadi Ganesh, Anne-Marie Kermarrec, Erwan Le Merrer, and Laurent Massoulié Peer counting and sampling in overlay networks based on random walks Distrib. Comput. 20 4 2007 267 278 (Pubitemid 350005917)
20. Robert Geisberger, Peter Sanders, Dominik Schultes, Better approximation of betweenness centrality, in: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), 2008.
21. P. Gleiser, and L. Danon Community structure in jazz Adv. Complex Syst. 6 2003 565
22. P. Hage, and F. Harary Eccentricity and centrality in networks Social Netw. 17 1 1995 57 63
23. W.K. Hastings Monte Carlo sampling methods using Markov chains and their applications Biometrika 57 1 1970 97 109
24. Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita, Impact of local topological information on random walks on finite graphs, in: ICALP, 2003, pp. 1054-1067.
25. Matthieu Latapy, Clémence Magnien, Measuring fundamental properties of real-world complex networks, CoRR, abs/cs/0609115, 2006.
26. Erwan Le Merrer, Gilles Trédan, Centralities: capturing the fuzzy notion of importance in social graphs, in: SNS '09: ACM EuroSys Workshop on Social Network Systems, 2009, pp. 33-38.
27. Qin Lv, Pei Cao, Edith Cohen, Kai Li, and Scott Shenker Search and replication in unstructured peer-to-peer networks ICS '02: Proceedings of the 16th International Conference on Supercomputing 2002 ACM New York, NY, USA 84 95 (Pubitemid 35039987)
28. Rajeev Motwani, and Prabhakar Raghavan Randomized Algorithms 1995 Cambridge University Press New York, NY, USA
29. Soumendra Nanda, David Kotz, Localized bridging centrality for distributed network analysis, in: Proceedings of the 17th International Conference on Computer Communications and Networks (ICCCN), August 2008, pp. 1-6.
30. Newman A measure of betweenness centrality based on random walks Social Netw. 27 1 2005 39 54 (Pubitemid 40272648)
31. Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd, The pagerank citation ranking: bringing order to the web, Technical Report, Stanford Digital Library Technologies Project, 1998.
32. Pascal Pons, Matthieu Latapy, Computing communities in large networks using random walks, in: Computer and Information Sciences - ISCIS 2005, vol. 3733, 2005, pp. 284-293.
33. Daniel Stutzbach, Reza Rejaie, Nick Duffield, Subhabrata Sen, and Walter Willinger On unbiased sampling for unstructured peer-to-peer networks IMC '06: Proceedings of the Sixth ACM SIGCOMM Conference on Internet Measurement 2006 ACM New York, NY, USA 27 40 (Pubitemid 47165586)
34. Stanley Wasserman, Katherine Faust, and Dawn Iacobucci Social Network Analysis : Methods and Applications (Structural Analysis in the Social Sciences) 1994 Cambridge University Press November
35. Jennifer Xu, and Hsinchun Chen The topology of dark networks Commun. ACM 51 10 2008 58 65