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.

17 pages, 3 figures

Cited by in corpus (8)

• Information geometry and sufficient statistics
• Information geometric methods for complexity
• Quantifying genuine multipartite correlations and their pattern complexity
• Complexity measures, emergence, and multiparticle correlations
• Riemannian-geometric entropy for measuring network complexity
• Improving Network Inference: The Impact of False Positive and False Negative Conclusions about the Presence or Absence of Links
• Analytical approach to network inference: Investigating degree distribution
• Iterative procedure for network inference