2009/08/13 by A Annibale, A. Annibale, A C C Coolen +7 · 2 citations
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Correlation #Degree (music) #Degree distribution #Graph #Graph theory and applications #Network topology #Null model #Random graph #Statistical Mechanics and Entropy #cond-mat.dis-nn
paper · pdf · doi:10.1088/1751-8113/42/48/485001
25 pages, 3 figures
arxiv created 2009/08/13 · openalex publication_date 2009/11/11 · arxiv updated 2015/05/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
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.