Abstract
Most studies concerning the influence of network structure on phenomena taking place on the network focus on relationships between global statistics of the network structure and characteristic properties of those phenomena, even though local structure has a significant effect on the dynamics of some phenomena. In the present paper, we propose a new analysis method for phenomena on networks based on a categorization of nodes. First, local statistics such as the average path length and the clustering coefficient for a node are calculated and assigned to the respective node. Then, the nodes are categorized using the self-organizing map algorithm. Characteristic properties of the phenomena of interest are visualized for each category of nodes. The validity of our method is demonstrated using the results of two simulation models. The proposed method is useful as a research tool to understand the behavior of networks, in particular, for the large-scale networks for which existing visualization techniques cannot work well.
Similar content being viewed by others
References
Adnan M, Nagi M, Kianmehr K, Tahboub R, Ridley M, Rokne J (2011) Promoting where, when and what? An analysis of web logs by integrating data mining and social network techniques to guide ecommerce business promotions. Soc Netw Analysis Min 1(3):173–185
Batagelj V, Mrvar A (2003) Pajek-analysis and visualization of large networks. Lect Notes Comp Sci 2265:77–103
Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: structure and dynamics. Phys Rep 424(4–5):175–308. ISSN 0370-1573
Cha M, Pérez JAN, Haddadi H (2011) The spread of media content through blogs. Soc Netw Analysis Min. doi:10.1007/s13278-011-0040-x
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174. ISSN 0370-1573
Gómez-Gardenes J, Moreno Y, Arenas A (2007) Paths to synchronization on complex networks. Phys Rev Lett 98(3):34101. ISSN 1079-7114
Holme P, Kim BJ (2002) Growing scale-free networks with tunable clustering. Phys Rev E 65(2):26107
Kamada T, Kawai S (1989) An algorithm for drawing general indirect graphs. Inf Process Lett 31:7–15
Moreno Y, Pastor-Satorras R, Vespignani A (2002) Epidemic outbreaks in complex heterogeneous networks. Eur Phys J B-Condens Matter Complex Syst 26(4):521–529
Newman MEJ (2006a) Finding community structure in networks using the eigen vectors of matrices. Phys Rev E 74(3):36104. ISSN 1550-2376
Newman MEJ (2006b) Modularity and community structure in networks. Proc Nat Acad Sci 103(23):8577
Nowak MA, May RM (1992) Evolutionary games and spatial chaos. Nature 359(6398):826–829. ISSN 0028-0836
Nowak MA, Sasaki A, Taylor C, Fudenberg D (2004) Emergence of cooperation and evolutionary stability in finite populations. Nature 428(6983):646–650. ISSN 0028-0836
Parshani R, Carmi S, Havlin S (2010) Epidemic threshold for the Susceptible-Infectious-Susceptible Model on random networks. Phys Rev Lett 104(25):258701
Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86(14):3200–3203
Pham MC, Klamma R, Jarke M (2011) Development of computer science disciplines: a social network analysis approach. Soc Netw Analysis Min 1(4):321–340
Rosen D, Barnett GA, Kim JH (2011) Social networks and online environments: when science and practice co-evolve. Soc Netw Analysis Min 1(1):27–42
Saravanan M, Prasad G, Karishma S, Suganthi D (2011) Analyzing and labeling telecom communities using structural properties. Soc Netw Analysis Min 1(4):271–286
Tomochi M (2004) Defectors’ niches: prisoner’s dilemma game on disordered networks. Soc Netw 26(4):309–321. ISSN 0378-8733
Tsukamoto E, Shirayama S (2010) Influence of the variance of degree distributions on the evolution of cooperation in complex networks. Phys A: Stat Mech Appl 389(3):577–586
Uchida M, Shirayama S (2007) Formation of patterns from complex networks. J Vis 10(3):253–255. ISSN 1343-8875
Van Ham F, Wattenberg M (2008) Centrality based visualization of small world graphs. In: Computer Graphics Forum, vol 27, Wiley Online Library, pp 975–982
Vázquez A (2003) Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. Phys Rev E 67(5):56104
Acknowledgment
This work was partially supported by Grant-in-Aid for Scientific Research (B) (21300031).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yuasa, T., Shirayama, S. A new analysis method for simulations using node categorizations. Soc. Netw. Anal. Min. 2, 189–196 (2012). https://doi.org/10.1007/s13278-012-0048-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13278-012-0048-x