A Annibale, Acc Coolen, Lp Fernandes, F Fraternali, J Kleinjung
{"title":"Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure.","authors":"A Annibale, Acc Coolen, Lp Fernandes, F Fraternali, J Kleinjung","doi":"10.1088/1751-8113/42/48/485001","DOIUrl":null,"url":null,"abstract":"<p><p>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.</p>","PeriodicalId":87442,"journal":{"name":"Journal of physics A: Mathematical and general","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1088/1751-8113/42/48/485001","citationCount":"102","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of physics A: Mathematical and general","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/1751-8113/42/48/485001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 102
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
