First Page | Document Content | |
---|---|---|
![]() Date: 2015-09-22 01:14:30Network theory Complex network Clustering coefficient Ume Scale-free network Betweenness centrality Computer cluster Centrality Shortest path problem | Add to Reading List |
![]() | Estimating the Clustering Coefficient of a Social Network by a Non-Backtracking Random Walk Kenta Iwasaki, and Kazuyuki Shudo Tokyo Institute of Technology Abstract—The clustering coefficient of social networks can beDocID: 1uxoe - View Document |
![]() | Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 3, duepts) Claim: the clustering coefficient of an undirected, unweighted and connected graphDocID: 1sAgd - View Document |
![]() | Network Analysis and Modeling, CSCI 5352 Lecture 5 1 Prof. Aaron ClausetDocID: 1rnq4 - View Document |
![]() | Network Analysis and Modeling, CSCI 5352 Lecture 8 1 Prof. Aaron ClausetDocID: 1rilN - View Document |
![]() | Social Networks Under Stress Daniel M. Romero University of Michigan Ann Arbor, MIDocID: 1r30t - View Document |