arXiv · 0912.4450
Quantifying structure in networks
Abstract
We investigate exponential families of random graph distributions as a framework for systematic quantification of structure in networks. In this paper we restrict ourselves to undirected unlabeled graphs. For these graphs, the counts of subgraphs with no more than k links are a sufficient statistics for the exponential families of graphs with interactions between at most k links. In this framework we investigate the dependencies between several observables commonly used to quantify structure in networks, such as the degree distribution, cluster and assortativity coefficients.
Explore related subjects
Keep this discovery
Eckehard Olbrich, Thomas Kahle, Nils Bertschinger, Nihat Ay, Juergen Jost. 2009-12-22. Quantifying structure in networks. https://doi.org/10.1140/epjb/e2010-00209-0
Cite the original work for its findings. Save a collection to share your selection of sources.