QIN WANG, WENJIA MA, KEQIN CUI, QINGCHENG ZENG, LIFENG XI
{"title":"自相似平面分形生成的复杂网络","authors":"QIN WANG, WENJIA MA, KEQIN CUI, QINGCHENG ZENG, LIFENG XI","doi":"10.1142/s0218348x24500646","DOIUrl":null,"url":null,"abstract":"<p>Many complex networks have scale-free and small-world effects. In this paper, a family of evolving networks is constructed modeled by a non-symmetric self-similar planar fractal, using the encoding method in fractal geometry. Based on the self-similar structure, we study the degree distribution, clustering coefficient and average path length of our evolving network to verify their scale-free and small-world characteristics.</p>","PeriodicalId":501262,"journal":{"name":"Fractals","volume":"7 6 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"COMPLEX NETWORKS GENERATED BY A SELF-SIMILAR PLANAR FRACTAL\",\"authors\":\"QIN WANG, WENJIA MA, KEQIN CUI, QINGCHENG ZENG, LIFENG XI\",\"doi\":\"10.1142/s0218348x24500646\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Many complex networks have scale-free and small-world effects. In this paper, a family of evolving networks is constructed modeled by a non-symmetric self-similar planar fractal, using the encoding method in fractal geometry. Based on the self-similar structure, we study the degree distribution, clustering coefficient and average path length of our evolving network to verify their scale-free and small-world characteristics.</p>\",\"PeriodicalId\":501262,\"journal\":{\"name\":\"Fractals\",\"volume\":\"7 6 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-26\",\"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/s0218348x24500646\",\"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/s0218348x24500646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
COMPLEX NETWORKS GENERATED BY A SELF-SIMILAR PLANAR FRACTAL
Many complex networks have scale-free and small-world effects. In this paper, a family of evolving networks is constructed modeled by a non-symmetric self-similar planar fractal, using the encoding method in fractal geometry. Based on the self-similar structure, we study the degree distribution, clustering coefficient and average path length of our evolving network to verify their scale-free and small-world characteristics.