{"title":"基于贝德福德-麦克马伦地毯的分形网络的三个特性","authors":"JIAN ZHENG, CHENG ZENG, YUMEI XUE, XIAOHAN LI","doi":"10.1142/s0218348x24500324","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we consider the networks modeled by several self-affine sets based on the Bedford–Mcmullen carpet. We calculate three properties of the networks, including the cumulative degree distribution, the average clustering coefficient and the average path length. We show that such networks have scale-free and small-world effects.</p>","PeriodicalId":501262,"journal":{"name":"Fractals","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"THREE PROPERTIES OF FRACTAL NETWORKS BASED ON BEDFORD–MCMULLEN CARPET\",\"authors\":\"JIAN ZHENG, CHENG ZENG, YUMEI XUE, XIAOHAN LI\",\"doi\":\"10.1142/s0218348x24500324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we consider the networks modeled by several self-affine sets based on the Bedford–Mcmullen carpet. We calculate three properties of the networks, including the cumulative degree distribution, the average clustering coefficient and the average path length. We show that such networks have scale-free and small-world effects.</p>\",\"PeriodicalId\":501262,\"journal\":{\"name\":\"Fractals\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fractals\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0218348x24500324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fractals","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0218348x24500324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
THREE PROPERTIES OF FRACTAL NETWORKS BASED ON BEDFORD–MCMULLEN CARPET
In this paper, we consider the networks modeled by several self-affine sets based on the Bedford–Mcmullen carpet. We calculate three properties of the networks, including the cumulative degree distribution, the average clustering coefficient and the average path length. We show that such networks have scale-free and small-world effects.