复杂网络的登信息维度 d-SUMMABLE 方法

Fractals Pub Date : 2024-02-19 DOI:10.1142/s0218348x24500440

ALDO RAMIREZ-ARELLANO, JUAN BORY-REYES

{"title":"复杂网络的登信息维度 d-SUMMABLE 方法","authors":"ALDO RAMIREZ-ARELLANO, JUAN BORY-REYES","doi":"10.1142/s0218348x24500440","DOIUrl":null,"url":null,"abstract":"Several new network information dimension definitions have been proposed in recent decades, expanding the scope of applicability of this seminal tool. This paper proposes a new definition based on Deng entropy and d-summability (a concept from geometric measure theory). We will prove to what extent the new formulation will be useful in the theoretical and applied points of view.","PeriodicalId":501262,"journal":{"name":"Fractals","volume":"26 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A d-SUMMABLE APPROACH TO DENG INFORMATION DIMENSION OF COMPLEX NETWORKS\",\"authors\":\"ALDO RAMIREZ-ARELLANO, JUAN BORY-REYES\",\"doi\":\"10.1142/s0218348x24500440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several new network information dimension definitions have been proposed in recent decades, expanding the scope of applicability of this seminal tool. This paper proposes a new definition based on Deng entropy and d-summability (a concept from geometric measure theory). We will prove to what extent the new formulation will be useful in the theoretical and applied points of view.\",\"PeriodicalId\":501262,\"journal\":{\"name\":\"Fractals\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-02-19\",\"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/s0218348x24500440\",\"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/s0218348x24500440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

近几十年来，人们提出了一些新的网络信息维度定义，扩大了这一开创性工具的适用范围。本文提出的新定义基于邓熵和 d-可求和性（几何度量理论中的一个概念）。我们将从理论和应用角度证明新定义的实用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A d-SUMMABLE APPROACH TO DENG INFORMATION DIMENSION OF COMPLEX NETWORKS

Several new network information dimension definitions have been proposed in recent decades, expanding the scope of applicability of this seminal tool. This paper proposes a new definition based on Deng entropy and d-summability (a concept from geometric measure theory). We will prove to what extent the new formulation will be useful in the theoretical and applied points of view.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Fractals

自引率

0.00%

发文量