Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2014, Special Issue (2013), Article ID 874708, 6 pages.

Social Network Analysis Based on Network Motifs

Xu Hong-lin, Yan Han-bing, Gao Cui-fang, and Zhu Ping

Full-text: Open access

Abstract

Based on the community structure characteristics, theory, and methods of frequent subgraph mining, network motifs findings are firstly introduced into social network analysis; the tendentiousness evaluation function and the importance evaluation function are proposed for effectiveness assessment. Compared with the traditional way based on nodes centrality degree, the new approach can be used to analyze the properties of social network more fully and judge the roles of the nodes effectively. In application analysis, our approach is shown to be effective.

Article information

Source
J. Appl. Math., Volume 2014, Special Issue (2013), Article ID 874708, 6 pages.

Dates
First available in Project Euclid: 1 October 2014

Permanent link to this document
https://projecteuclid.org/euclid.jam/1412177645

Digital Object Identifier
doi:10.1155/2014/874708

Mathematical Reviews number (MathSciNet)
MR3173339

Citation

Hong-lin, Xu; Han-bing, Yan; Cui-fang, Gao; Ping, Zhu. Social Network Analysis Based on Network Motifs. J. Appl. Math. 2014, Special Issue (2013), Article ID 874708, 6 pages. doi:10.1155/2014/874708. https://projecteuclid.org/euclid.jam/1412177645


Export citation

References

  • S. H. Strogatz, “Exploring complex networks,” Nature, vol. 410, no. 6825, pp. 268–276, 2001.
  • M. E. J. Newman, “Assortative mixing in networks,” Physical Review Letters, vol. 89, no. 20, Article ID 208701, 4 pages, 2002.
  • D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998.
  • T. N. Friemel, “Dynamics of social networks,” Procedia-Social and Behavioral Sciences, vol. 22, pp. 2–3, 2011.
  • J. Xu and H. Chen, “Criminal network analysis and visualization,” Communications of the Association for Computing Machinery, vol. 48, no. 6, pp. 100–107, 2005.
  • C. Brun, F. Chevenet, D. Martin, J. Wojcik, A. Guénoche, and B. Jacq, “Functional classification of proteins for the prediction of cellular function from a protein-protein interaction network,” Genome Biology, vol. 5, no. 1, pp. 1474–1760, 2003.
  • E. Ravasz, A. L. Somera, D. A. Mongru, Z. N. Oltvai, and A.-L. Barabási, “Hierarchical organization of modularity in metabolic networks,” Science, vol. 297, no. 5586, pp. 1551–1555, 2002.
  • K. Musiał and P. Kazienko, “Social networks on the Internet,” World Wide Web, vol. 16, no. 1, pp. 31–72, 2013.
  • C. E. Hutchins and M. Benham-Hutchins, “Hiding in plain sight: criminal network analysis,” Computational and Mathematical Organization Theory, vol. 16, no. 1, pp. 89–111, 2010.
  • M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002.
  • T. Velden, A. Haque, and C. Lagoze, “A new approach to analyzing patterns of collaboration in co-authorship networks: mesoscopic analysis and interpretation,” Scientometrics, vol. 85, no. 1, pp. 219–242, 2010.
  • M. E. J. Newman, “The structure and function of complex net-works,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003.
  • R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: simple building blocks of complex networks,” Science, vol. 298, no. 5594, pp. 824–827, 2002.
  • W. Kim, M. Li, J. Wang, and Y. Pan, “Biological network mo-tif detection and evaluation,” BMC Systems Biology, vol. 5, Supplement 3, article S5, 2011.
  • L. Farina, A. Germani, G. Mavelli, and P. Palumbo, “Identification of regulatory network motifs from gene expression data,” Journal of Mathematical Modelling and Algorithms, vol. 9, no. 3, pp. 233–245, 2010.
  • T. Ohnishi, H. Takayasu, and M. Takayasu, “Network motifs in an inter-firm network,” Journal of Economic Interaction and Coordination, vol. 5, no. 2, pp. 171–180, 2010.
  • Q. H. Zhu and L. Li, “Social network analysis method and appli-cation study in information science,” Information Study, vol. 31, no. 2, pp. 179–183, 2008.
  • P. Chen and H. Y. Yuan, “Social network analysis of crime organ-ization structures,” Journal of Tsinghua University, vol. 51, no. 8, pp. 1097–1101, 2011.
  • D. Gómez, E. González-Arangüena, C. Manuel, G. Owen, M. del Pozo, and M. Saboyá, “The cohesiveness of subgroups in social networks: a view from game theory,” Annals of Operations Research, vol. 158, no. 1, pp. 33–46, 2008.
  • X. G. Wang, “Discovering critical nodes in social networks based on cooperative games,” Computer Science, vol. 40, no. 4, pp. 155–159, 2013.
  • K. Juszczyszyn, P. Kazienko, and K. Musial, “Local topology of social network based on motif analysis,” in Knowledge-Based Intelligent Information and Engineering Systems, vol. 5178 of Lecture Notes in Computer Science, pp. 97–105, 2008.
  • K. Juszczyszyn and K. Musial, “Motif analysis and the periodic structural changes in an organizational email-based social network,” International Journal of Virtual Communities and Social Networking, vol. 1, no. 2, 14 pages, 2009.
  • X.-T. Li, J.-Z. Li, and H. Gao, “Efficient frequent subgraph mining algorithm,” Journal of Software, vol. 18, no. 10, pp. 2469–2480, 2007.
  • H. M. Lu, B. Q. Feng, and Q. B. Song, “Survey of frequent sub-graph mining research,” Microelectronics & Computer, vol. 26, no. 3, pp. 156–161, 2009.
  • G.-M. Qin, L. Gao, and J.-L. Hu, “A review on algorithms for network motif discovery in biological networks,” Acta Electronica Sinica, vol. 37, no. 10, pp. 2258–2265, 2009.
  • R. Milo, N. Kashtan, S. Itzkovitz, M. E. J. Neuman, and U. Alon, “On the uniform generation of random graphs with prescribed degree sequences,” Cond-mat/0312028, 2003.
  • N. Kashtan, S. Itzkovitz, R. Milo, and U. Alon, “Efficient sam-pling algorithm for estimating subgraph concentrations and detecting network motifs,” Bioinformatics, vol. 20, no. 11, pp. 1746–1758, 2004.
  • ICM, “Modeling for crime busting,” The Interdisciplinary Contest in Modeling, 2012. \endinput