Table of Contents Author Guidelines Submit a Manuscript
Table of Contents Alerts

To receive news and publication updates for Scientific Programming, enter your email address in the box below.

Scientific Programming
Volume 2017, Article ID 5046905, 6 pages
https://doi.org/10.1155/2017/5046905
Research Article

Analysis of the Dynamic Influence of Social Network Nodes

Hong-Jian Yin, Hai Yu, Yu-Li Zhao, Zhi-Liang Zhu, and Wei Zhang

Software College, Northeastern University, No. 195, Chuangxin Road, Shenyang, Liaoning, China

Correspondence should be addressed to Hai Yu; moc.621@iahuy

Received 21 October 2016; Accepted 5 January 2017; Published 31 January 2017

Academic Editor: Fabrizio Riguzzi

Copyright © 2017 Hong-Jian Yin et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Milgram, “The small world problem,” Psychology Today, vol. 2, no. 1, pp. 60–67, 1967. View at Google Scholar
  2. D. J. Watts and S. H. Strogatz, “Collective dynamics of 'small-world' networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Backstrom, P. Boldi, M. Rosa, J. Ugander, and S. Vigna, “Four degrees of separation,” in Proceedings of the 4th Annual ACM Web Science Conference, pp. 33–42, 2012.
  4. N. A. Christakis and J. H. Fowler, Connected: The Surprising Power of Our Social Networks and How They Shape Our Lives-How Your Friends' Friends' Friends Affect Everything You Feel, Think, and Do, Little, Brown and Company, New York, NY, USA, 2011.
  5. R. Albert, H. Jeong, and A.-L. Barabási, “Error and attack tolerance of complex networks,” Nature, vol. 406, no. 6794, pp. 378–382, 2000. View at Publisher · View at Google Scholar · View at Scopus
  6. R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,” Physical Review Letters, vol. 86, no. 14, pp. 3200–3203, 2001. View at Publisher · View at Google Scholar · View at Scopus
  7. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin, “Breakdown of the internet under intentional attack,” Physical Review Letters, vol. 86, no. 16, pp. 3682–3685, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Jian-Guo, R. Zhuo-Ming, G. Qiang, and W. Bing-Hong, Node Importance Ranking of Complex Networks, 2013.
  9. L. C. Freeman, “A Set of measures of centrality based on betweenness,” Sociometry, vol. 40, no. 1, pp. 35–41, 1977. View at Publisher · View at Google Scholar
  10. N. E. Friedkin, “Theoretical foundations for centrality measures,” American Journal of Sociology, vol. 96, no. 6, pp. 1478–1504, 1991. View at Publisher · View at Google Scholar
  11. G. Sabidussi, “The centrality index of a graph,” Psychometrika, vol. 31, no. 4, pp. 581–603, 1966. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. K. Stephenson and M. Zelen, “Rethinking centrality: methods and examples,” Social Networks, vol. 11, no. 1, pp. 1–37, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. S. P. Borgatti, “Centrality and network flow,” Social Networks, vol. 27, no. 1, pp. 55–71, 2005. View at Publisher · View at Google Scholar · View at Scopus
  14. L.-L. Ma, C. Ma, and H.-F. Zhang, “Identifying influential spreaders in complex networks based on gravity formula,” Physica A, vol. 451, pp. 205–212, 2016. View at Publisher · View at Google Scholar
  15. S. Carmi, S. Havlin, S. Kirkpatrick, Y. Shavitt, and E. Shir, “A model of Internet topology using k-shell decomposition,” Proceedings of the National Academy of Sciences of the United States of America, vol. 104, no. 27, pp. 11150–11154, 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: bringing order to the web,” Stanford Digital Library Technologies Project, 1999. View at Google Scholar
  17. L. J. S. Allen, “Some discrete-time SI, SIR, and SISepidemic models,” Mathematical Biosciences, vol. 124, no. 1, pp. 83–105, 1994. View at Publisher · View at Google Scholar · View at Scopus
  18. B. Shulgin, L. Stone, and Z. Agur, “Pulse vaccination strategy in the SIR epidemic model,” Bulletin of Mathematical Biology, vol. 60, no. 6, pp. 1123–1148, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. H. W. Hethcote, “The mathematics of infectious diseases,” SIAM Review, vol. 42, no. 4, pp. 599–653, 2000. View at Google Scholar
  20. M. J. Keeling and P. Rohani, Modeling Infectious Diseases in Humans and Animals, Princeton University Press, Princeton, NJ, USA, 2008. View at MathSciNet
  21. J. Heesterbeek, Mathematical Epidemiology of Infectious Diseases: Model Building, Analysis and Interpretation, vol. 5, John Wiley & Sons, New York, NY, USA, 2000.
  22. N. Blagus, L. Šubelj, and M. Bajec, “Self-similar scaling of density in complex real-world networks,” Physica A: Statistical Mechanics and its Applications, vol. 391, no. 8, pp. 2794–2802, 2012. View at Publisher · View at Google Scholar
  23. L. Tang and H. Liu, “Relational learning via latent social dimensions,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 817–826, ACM, Paris, France, July 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. P. Erdős and T. Gallai, “On maximal paths and circuits of graphs,” Acta Mathematica Academiae Scientiarum Hungaricae, vol. 10, no. 3-4, pp. 337–356, 1959. View at Publisher · View at Google Scholar
  26. M. O. Jackson, Social and economic networks, Princeton University Press, Princeton, NJ, USA, 2008. View at MathSciNet
  27. A. Fronczak, P. Fronczak, and J. A. Hołyst, “Average path length in random networks,” Physical Review E, vol. 70, no. 5, Article ID 056110, 2004. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Barreiras, “Diameter constrained network,” in Proceedings of the World Congress on Engineering, vol. 2, 2009.
  29. L. Kowalik, “Approximation scheme for lowest outdegree orientation and graph density measures,” in Proceedings of the 17th International Conference on Algorithms and Computation (ISAAC '06), pp. 557–566, Kolkata, India, December 2006. View at Publisher · View at Google Scholar
  30. J. Saramäki, M. Kivelä, J.-P. Onnela, K. Kaski, and J. Kertész, “Generalizations of the clustering coefficient to weighted complex networks,” Physical Review E, vol. 75, no. 2, Article ID 027105, 2007. View at Publisher · View at Google Scholar · View at Scopus
  31. T. Schank and D. Wagner, “Approximating clustering coefficient and transitivity,” Journal of Graph Algorithms and Applications, vol. 9, no. 2, pp. 265–275, 2005. View at Publisher · View at Google Scholar