<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-07-22 15:11:41Networks Algebraic graph theory Network analysis Small-world network Centrality Flow network Shortest path problem Complex network Clustering coefficient Graph theory Network theory Mathematics |
| 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 |