pith. sign in

arxiv: 0908.1759 · v2 · pith:HQLMJDKVnew · submitted 2009-08-12 · ❄️ cond-mat.dis-nn

Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure

classification ❄️ cond-mat.dis-nn
keywords degreeensemblesnetworksdistributiongraphquantifyingrealtools
0
0 comments X
read the original abstract

We study the tailoring of structured random graph ensembles to real networks, with the objective of generating precise and practical mathematical tools for quantifying and comparing network topologies macroscopically, beyond the level of degree statistics. Our family of ensembles can produce graphs with any prescribed degree distribution and any degree-degree correlation function, its control parameters can be calculated fully analytically, and as a result we can calculate (asymptotically) formulae for entropies and complexities, and for information-theoretic distances between networks, expressed directly and explicitly in terms of their measured degree distribution and degree correlations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.