{"title":"微正则有限图系综的熵","authors":"T. Kawamoto","doi":"10.1088/2632-072X/acf01c","DOIUrl":null,"url":null,"abstract":"The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the mean-field approximations of the generating function using the Chebyshev–Hermite polynomials provide estimates for the entropy of finite-graph ensembles. Our estimate reproduces the Bender–Canfield formula in the limit of large graphs.","PeriodicalId":53211,"journal":{"name":"Journal of Physics Complexity","volume":"4 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2023-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Entropy of microcanonical finite-graph ensembles\",\"authors\":\"T. Kawamoto\",\"doi\":\"10.1088/2632-072X/acf01c\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the mean-field approximations of the generating function using the Chebyshev–Hermite polynomials provide estimates for the entropy of finite-graph ensembles. Our estimate reproduces the Bender–Canfield formula in the limit of large graphs.\",\"PeriodicalId\":53211,\"journal\":{\"name\":\"Journal of Physics Complexity\",\"volume\":\"4 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2023-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Physics Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1088/2632-072X/acf01c\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2632-072X/acf01c","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the mean-field approximations of the generating function using the Chebyshev–Hermite polynomials provide estimates for the entropy of finite-graph ensembles. Our estimate reproduces the Bender–Canfield formula in the limit of large graphs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
