On the Fractality of Complex Networks: Covering Problem, Algorithms and Ahlfors Regularity

In this paper, we revisit the fractality of complex network by investigating three dimensions with respect to minimum box-covering, minimum ball-covering and average volume of balls. The first two dimensions are calculated through the minimum box-covering problem and minimum ball-covering problem. F...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Lihong, Wang, Qin, Xi, Lifeng, Chen, Jin, Wang, Songjing, Bao, Liulu, Yu, Zhouyu, Zhao, Luming
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group 2017
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5269725/
https://www.ncbi.nlm.nih.gov/pubmed/28128289
http://dx.doi.org/10.1038/srep41385

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5269725/
https://www.ncbi.nlm.nih.gov/pubmed/28128289
http://dx.doi.org/10.1038/srep41385

Ejemplares similares