Piecewise-linear distance-dependent random graph models

First Page		Document Content
Date: 2013-01-15 22:33:07 Graph Random graphs Bipartite graph Complex network Clustering coefficient Pseudoforest Erdős–Rényi model Graph theory Network theory Matroid theory		Piecewise-linear distance-dependent random graph models Add to Reading List Source URL: www.mssanz.org.au Download Document from Source Website File Size: 1,11 MB Share Document on Facebook

	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 be DocID: 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 graph DocID: 1sAgd - View Document
	Network Analysis and Modeling, CSCI 5352 Lecture 5 1 Prof. Aaron Clauset DocID: 1rnq4 - View Document
	Network Analysis and Modeling, CSCI 5352 Lecture 8 1 Prof. Aaron Clauset DocID: 1rilN - View Document
	Social Networks Under Stress Daniel M. Romero University of Michigan Ann Arbor, MI DocID: 1r30t - View Document