Identifying influential nodes in complex networks with community structure

Knowledge-Based Systems

Volumn 42, Issue , 2013, Pages 74-84

  Zhang, Xiaohang ^a   Zhu, Ji ^b   Wang, Qi ^a   Zhao, Han ^a  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Bond percolation process; Community; Complex networks; Influential nodes; k Medoid clustering

Indexed keywords

BETWEENNESS CENTRALITY; BOND PERCOLATION; CLOSENESS CENTRALITIES; COMMUNITY; COMMUNITY STRUCTURES; DECOMPOSITION METHODS; GREEDY ALGORITHMS; IN NETWORKS; INCLUDING DEGREES; INFLUENTIAL INDIVIDUALS; INFLUENTIAL NODES; INFORMATION TRANSFERS; K-MEDOID; K-MEDOID CLUSTERING ALGORITHMS; K-SHELLS;

CLUSTERING ALGORITHMS; HEURISTIC METHODS; SOCIAL SCIENCES;

COMPLEX NETWORKS;

EID: 84874652140     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2013.01.017     Document Type: Article

References (38)

1. S.H. Strogatz Exploring complex networks Nature 410 2001 268 276 (Pubitemid 32216604)
2. M.E.J. Newman The structure and function of complex networks SIAM Rev. 45 2003 167 256
3. Y. Kim, and H.S. Song Strategies for predicting local trust based on trust propagation in social networks Knowl. Based Syst. 24 2011 1360 1371
4. E.M. Rogers Diffusion of Innovations 2003 Free Press New York
5. M.J. Keeling, and P. Rohani Modeling Infectious Diseases in Humans and Animals 2008 Princeton University Press Princeton
6. D. Kempe, J. Kleinberg, and E. Tardos Maximizing the spread of influence through a social network Proc. Conf. on Knowl. Disc. and Data Min 2003 ACM New York, Washington, DC 137 146
7. M. Kitsak, L.K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H.E. Stanley, and H.A. Makse Identification of influential spreaders in complex networks Nat. Phys. 6 2010 888 893
8. M. Kimura, K. Saito, R. Nakano, and H. Motoda Extracting influential nodes on a social network for information diffusion Data Min. Knowl. Disc. 20 2010 70 97
9. C. Kaiser, S. Schlick, and F. Bodendorf Warning system for online market research-identifying critical situations in online opinion formation Knowl. Based Syst. 24 2011 824 836
10. M.P. OMahony, and B. Smyth A classification-based review recommender Knowl. Based Syst. 23 2010 323 329
11. M.E.J. Newman Modularity and community structure in networks Proc. Natl. Acad. Sci. USA 103 2006 8577 8582 (Pubitemid 43878062)
12. J. Goldenberg, B. Libai, and E. Muller Talk of the network: a complex systems look at the underlying process of word-of-mouth Mark. Lett. 12 2001 211 223 (Pubitemid 33686497)
13. A. Lancichinetti, S. Fortunato, and F. Radicchi Benchmark graphs for testing community detection algorithms Phys. Rev. E 78 2008 046110
14. A. Lancichinetti, and S. Fortunato Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities Phys. Rev. E 80 2009 016118
15. M. Molloy, and B. Reed The size of the giant component of a random graph with a given degree sequence Combinatorics Probab. Comput. 7 1998 295 305 (Pubitemid 128480814)
16. A Software Package to Generate the Benchmark Graphs. < http://santo.fortunato.googlepages.com/benchmark.tgz >.
17. T. Opsahl, F. Agneessens, and J. Skvoretz Node centrality in weighted networks: generalizing degree and shortest paths Soc. Netw. 32 2010 245 251
18. P. De Meo, E. Ferrara, G. Fiumara, and A. Ricciardello A novel measure of edge centrality in social networks Knowl. Based Syst. 30 2012 136 150
19. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin Breakdown of the Internet under Intentional Attack Phys. Rev. Lett. 86 2001 3682 3685 (Pubitemid 32416204)
20. R. Pastor-satorras, and A. Vespignani Epidemic spreading in scale-free networks Phys. Rev. Lett. 86 2001 3200 3203 (Pubitemid 32317894)
21. 2) algorithm for detecting communities of unbalanced sizes in large scale social networks Knowl. Based Syst. 2012 10.1016/j.knosys.2012.05.021
22. L.C. Freeman Centrality in social networks: conceptual clarification Soc. Netw. 1 1979 215 239
23. N.E. Friedkin Theoretical foundations for centrality measures Am. J. Sociol. 96 1991 1478 1504
24. G. Sabidussi The centrality index of a graph Psychometrika 31 1966 581 603
25. D. Lusseau, K. Schneider, O.J. Boisseau, P. Hasse, E. Slooten, and S.M. Dawson The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations Behav. Ecol. Sociobiol. 54 2003 396 405 (Pubitemid 37144024)
26. S. Theodoridis, and K. Koutroumbas Pattern Recognition 2009 Elsevier San Diego
27. http://en.wikipedia.org.
28. S.R. Broadbent, and J.M. Hammersley Percolation processes Math. Proc. Cambridge Philos. Soc. 53 1957 629 641
29. P. Grassberger On the critical behavior of the general epidemic process and dynamical percolation Math. Biosci. 63 1983 157 172 (Pubitemid 13085555)
30. M.E.J. Newman Spread of epidemic disease on networks Phys. Rev. E 66 2002 016128
31. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein Introduction to Algorithms 2001 MIT Press Boston
32. R.E. Tarjan Depth-first search and linear graph algorithms SIAM J. Comput. 1 1972 146 160
33. L. Kaufman, and P.J. Rousseeuw Finding Groups in Data: An Introduction to Cluster Analysis 1990 John Wiley & Sons New York
34. W.W. Zachary An information flow model for conflict and fission in small groups J. Anthropol. Res. 33 1977 452 473
35. R. Ruimera, L. Danon, A. Diaz-Guilera, F. Giralt, and A. Arenas Self-similar community structure in a network of human interactions Phys. Rev. E 68 2003 065103
36. L. Donetti, and M.A. Munoz Detecting network communities: a new systematic and efficient algorithm J. Stat. Mech. 2004 2004 P10012
37. S. Fortunato Community detection in graphs Phys. Rep. 486 2010 75 174
38. S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, and E. Shir A model of Internet topology using k-shell decomposition Proc. Natl. Acad. Sci. USA 104 2007 11150 11154 (Pubitemid 47175109)