Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 7420281, 9 pages
https://doi.org/10.1155/2017/7420281
Research Article

Quasi-Closeness: A Toolkit for Social Network Applications Involving Indirect Connections

School of Securities and Futures, Southwestern University of Finance and Economics, Chengdu, China

Correspondence should be addressed to Yahui Liu; moc.liamg@annehc.iuhuil

Received 11 March 2017; Accepted 11 May 2017; Published 6 August 2017

Academic Editor: Yakov Strelniker

Copyright © 2017 Yugang Yin and Yahui Liu. 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. J. Moreno, Who Shall Survive? Foundations of Sociometry, Group Psychotherapy, and Sociodrama, Beacon House, Inc, Beacon, NY, USA, 1934.
  2. J. Scott and P. Carrington, The SAGE Handbook of Social Network Analysis, SAGE Publications, Thousand Oaks, Calif, USA, 2014.
  3. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, Cambridge University Press, Cambridge, UK, 1994. View at Publisher · View at Google Scholar
  4. M. E. J. Newman, “A measure of betweenness centrality based on random walks,” Social Networks, vol. 27, no. 1, pp. 39–54, 2005. View at Publisher · View at Google Scholar · View at Scopus
  5. L. C. Freeman, “Centrality in social networks conceptual clarification,” Social Networks, vol. 1, no. 3, pp. 215–239, 1978-1979. View at Publisher · View at Google Scholar · View at Scopus
  6. C. H. Proctor and C. P. Loomis, “Analysis of sociometric data,” Research Methods in Social Relations, vol. 2, pp. 561–585, 1951. View at Google Scholar
  7. M. Glanzer and R. Glaser, “Techniques for the study of group structure and behavior: I. Analysis of structure,” Psychological Bulletin, vol. 56, no. 5, pp. 317–332, 1959. View at Publisher · View at Google Scholar · View at Scopus
  8. R. L. Moxley and N. F. Moxley, “Determining point-centrality in uncontrived social networks,” Sociometry, vol. 37, no. 1, p. 122, 1974. View at Publisher · View at Google Scholar
  9. 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
  10. D. L. Rogers, “Sociometric analysis of interorganizational relations: application of theory and measurement,” Rural Sociology, vol. 39, no. 4, article 487, 1974. View at Google Scholar
  11. J. M. Anthonisse, “The rush in a graph,” Mathematische Centrum, Amsterdam, 1971.
  12. L. C. Freeman, D. Roeder, and R. R. Mulholland, “Centrality in social networks: II. Experimental results,” Social Networks, vol. 2, no. 2, pp. 119–141, 1979. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Bonacich, “Factoring and weighting approaches to status scores and clique identification,” Journal of Mathematical Sociology, vol. 2, pp. 113–120, 1972. View at Publisher · View at Google Scholar
  14. Y. Rochat, “Closeness centrality extended to unconnected graphs: the harmonic centrality index,” ASNA, 2009.
  15. A. Bavelas, “Communication patterns in task-oriented groups,” Journal of the Acoustical Society of America, vol. 22, no. 6, pp. 725–730, 1950. View at Publisher · View at Google Scholar · View at Scopus
  16. H. J. Leavitt, “Some effects of certain communication patterns on group performance,” Journal of Abnormal and Social Psychology, vol. 46, no. 1, pp. 38–50, 1951. View at Publisher · View at Google Scholar · View at Scopus
  17. M. A. Beauchamp, “An improved index of centrality,” Behavioral Science, vol. 10, pp. 161–163, 1965. View at Publisher · View at Google Scholar · View at Scopus
  18. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. C. H. Hubbell, “An input-output approach to clique identification,” Sociometry, vol. 28, no. 4, p. 377, 1965. View at Publisher · View at Google Scholar
  20. 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
  21. B. Bollobás, Modern Graph Theory, vol. 184, Springer, New York, NY, USA, 1998, Graduate Texts in Mathematics. View at MathSciNet
  22. R. Diestel, Graph Theory, Springer-Verlag Berlin and Heidelberg GmbH, Berlin, Germany, 2000.
  23. S. L. Hakimi, “Optimum distribution of switching centers in a communication network and some related graph theoretic problems,” Operations Research, vol. 13, pp. 462–475, 1965. View at Publisher · View at Google Scholar · View at MathSciNet
  24. C. Flament, M. Pinard, R. Breton, and F. Fontaine, Applications of Graph Theory to Group Structure, Prentice-Hall, Inc, Englewood Cliffs, NJ, USA, 1963. View at MathSciNet
  25. F. Harary, R. Z. Norman, and D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs, John Wiley & Sons, New York, NY, USA, 1965. View at MathSciNet
  26. B. M. Brentan, E. Campbell, G. L. Meirelles, E. Luvizotto, and J. Izquierdo, “Social network community detection for DMA creation: criteria analysis through multilevel optimization,” Mathematical Problems in Engineering, vol. 2017, Article ID 9053238, 12 pages, 2017. View at Publisher · View at Google Scholar
  27. J.-W. Jang, J. Woo, A. Mohaisen, J. Yun, and H. K. Kim, “Mal-netminer: malware classification approach based on social network analysis of system call graph,” Mathematical Problems in Engineering, vol. 2015, Article ID 769624, 20 pages, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. W. Jiang, R. Wang, Z. Xu, Y. Huang, S. Chang, and Z. Qin, “PRUB: a privacy protection friend recommendation system based on user behavior,” Mathematical Problems in Engineering, vol. 2016, Article ID 8575187, 12 pages, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  29. E. M. Reingold and J. S. Tilford, “Tidier drawings of trees,” IEEE Transactions on Software Engineering, vol. SE-7, no. 2, pp. 223–228, 1981. View at Publisher · View at Google Scholar · View at Scopus