Physics – Physics and Society
Scientific paper
2011-09-30
Physics
Physics and Society
8 pages,5 figures
Scientific paper
We reformulated the string formalism given by Aoyama, using an adjacent matrix of a network and introduced a series of generalized clustering coefficients based on it. Furthermore we numerically evaluated Milgram condition proposed by their article in order to explore $q$-$th$ degrees of separation in scale free networks. In this article, we apply the reformulation to small world networks and numerically evaluate Milgram condition, especially the separation number of small world networks and its relation to cycle structures are discussed. Considering the number of non-zero elements of an adjacent matrix, the average path length and Milgram condition, we show that the formalism proposed by us is effective to analyze the six degrees of separation, especially effective for analyzing the relation between the separation number and cycle structures in a network. By this analysis of small world networks, it proves that a sort of power low holds between $M_n$, which is a key quantity in Milgram condition, and the generalized clustering coefficients. This property in small world networks stands in contrast to that of scale free networks.
Toyota Norihito
No associations
LandOfFree
Separation Number and Generalized Clustering Coefficient in Small World Networks based on String Formalism does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Separation Number and Generalized Clustering Coefficient in Small World Networks based on String Formalism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separation Number and Generalized Clustering Coefficient in Small World Networks based on String Formalism will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-667455