Quantifying structure in networks

E. Olbrich (), T. Kahle, N. Bertschinger, N. Ay and J. Jost

The European Physical Journal B: Condensed Matter and Complex Systems, 2010, vol. 77, issue 2, 239-247

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. Copyright EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg 2010

Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1140/epjb/e2010-00209-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:eurphb:v:77:y:2010:i:2:p:239-247

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10051

DOI: 10.1140/epjb/e2010-00209-0

Access Statistics for this article

The European Physical Journal B: Condensed Matter and Complex Systems is currently edited by P. Hänggi and Angel Rubio

More articles in The European Physical Journal B: Condensed Matter and Complex Systems from Springer, EDP Sciences
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().