[1] Newman M E.The structure and function of complex networks[J].SIAM Review,2003,45(2):167-256.
[2] Boccaletti S,Latora V,Moreno Y,et al.Complex networks:Structure and dynamics[J].Physics Reports,2006,424(4):175-308.
[3] Zhang J,Zhou C,Xu X,et al.Mapping from structure to dynamics:A unified view of dynamical processes on networks[J].Physical Review E,2010,82(2):026116.
[4] Zhou T,Wang B H.Catastrophes in scale-free networks[J].Chinese Physics Letters,2005,22(5):1072-1075.
[5] Pastor-Satorras R,Vespignani A.Immunization of complex networks[J].Physical Review E,2002,65(3):036104.
[6] Freeman L C.Centrality in social networks conceptual clarification[J].Social Networks,1979,1(3):215-239.
[7] Sabidussi G.The centrality index of a graph[J].Psychometrika,1966,31(4):581-603.
[8] Freeman L C.A set of measures of centrality based on betweenness[J].Sociometry,1977,40(1):35-41.
[9] Bonacich P.Factor and weighting approaches to status scores and clique identification[J].Journal of Mathematical Socilogy,1972,2(1):113-120.
[10] Bonacich P.Some unique properties of eigenvector centrality[J].Social Networks,2007,29(4):555-564.
[11] Borgatti S P,Everett M G.A graph-theoretic perspective on centrality[J].Social Networks,2006,28(4):466-484.
[12] Chen D B,Lü L Y,Shang M S,et al.Identifying influential nodes in complex networks[J].Physica A,2012,391(4):1777-1787.
[13] Chvátal V.Tough graphs and Hamiltonian circuits[J].Discrete Mathematics,1973,5(3):215-228.
[14] 许进,席酉民,汪应洛.系统的核与核度(I)[J].系统科学与数学,1993,13(2):102-110. Xu J,Xi Y M,Wang Y L.On system core and coritivity (1)[J].Journal of System Science and Mathematical Science,1993,13(2):102-110.(in Chinese)
[15] Jung H A.On a class of posets and the corresponding comparability graphs[J].Journal of Combinatorial Theory Series B,1978,24(2):125-133.
[16] Sun J,Tang J.A survey of models and algorithms for social influence analysis[A].Social Network Data Analytics[C].New York:Springer,2011.177-214.
[17] 吴信东,李毅,李磊.在线社交网络影响力分析[J].计算机学报,2014,37(4):735-752. Wu X D,Li Y,Li L.Influence analysis of online social networks[J].Chinese Journal of Computers,2014,37(4):735-752.(in Chinese)
[18] Ma S J,Ren Z M,Ye C M,et al.Node influence identification via resource allocation dynamics[J].International Journal of Modern Physics C,2014,25(11):1450065.
[19] Saito K,Kimura M,Ohara K,et al.Super mediator-A new centrality measure of node importance for information diffusion over social network[J].Information Sciences,2016,329:985-1000.
[20] Hu F,Liu Y H.Multi-index algorithm of identifying important nodes in complex networks based on linear discriminant analysis[J].Modern Physics Letters B,2015,29(03):1450268.
[21] Kim H,Anderson R.Temporal node centrality in complex networks[J].Physical Review E,2012,85(2):605-624.
[22] Kas M,Wachs M,Carley K M,et al.Incremental algorithm for updating betweenness centrality in dynamically growing networks[A].Advances in Social Networks Analysis and Mining (ASONAM),2013 IEEE/ACM International Conference on IEEE[C].Niagara Falls,Canada:IEEE/ACM,2013.33-40.
[23] Gao Z X,Shi Y,Chen S Z.Measures of node centrality in mobile social networks[J].International Journal of Modern Physics C,2015,26(09):1550107.
[24] Zhang X,Zhu J,Wang Q,et al.Identifying influential nodes in complex networks with community structure[J].Knowledge-Based Systems,2013,42(2):74-84.
[25] Shakarian P,Salmento J,Pulleyblank W,et al.Reducing gang violence through network influence based targeting of social programs[A].Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C].New York,USA:ACM,2014.1829-1836.
[26] He X,Kempe D.Stability of influence maximization[A].Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining[C]. New York,USA:ACM,2014.1256-1265.
[27] Zhou C,Zhang P,Zang W,et al.Maximizing the long-term integral influence in social networks under the voter model[A].Proceedings of the 23rd International Conference on World Wide Web Conferences Steering Committee[C].Seoul,Korea:ACM,2014.423-424.
[28] Morone F,Makse H A.Influence maximization in complex networks through optimal percolation[J].Nature,2015,524(7563):65-68.
[29] Lamba H,Narayanam R.A model-independent approach for efficient influence maximization in social networks[J].Social Network Analysis & Mining,2015,5(1):1-11.
[30] Menger K.Zur allgemeinen Kurventheorie[J].Fundamenta Mathematicae,1927,10:96-115.
[31] Ford L P,Fulkerson D R.Maximal flow through a network[J].Canadian Journal of Mathematics,1956,8(3):399-404.
[32] Ford L P,Fulkerson D R.Flows in Networks[M].Princeton NJ:Princeton University Press,1962.
[33] Edmonds J,Karp R M.Theoretical improvements in algorithmic efficiency for network flow problems[J].Journal of the ACM,1972,19(2):248-264.
[34] Goldberg V A,Tarjan E R.A new approach to the maximum flow problem[J].Journal of the ACM,1988,35(4):921-940.
[35] Floyd R W.Algorithm 97:Shortest path[J].Communications of the ACM,1962,5(6):345.
[36] Johnson D B.Efficient algorithms for shortest paths in sparse networks[J].Journal of the ACM,1977,24(1):1-13.
[37] Zachary W W.An information flow model for conflict and fission in small groups[J].Journal of Anthropological Research,1977,33(4):452-473. |