Cargando…
Box-covering algorithm for fractal dimension of weighted networks
Box-covering algorithm is a widely used method to measure the fractal dimension of complex networks. Existing researches mainly deal with the fractal dimension of unweighted networks. Here, the classical box covering algorithm is modified to deal with the fractal dimension of weighted networks. Box...
Autores principales: | Wei, Dai-Jun, Liu, Qi, Zhang, Hai-Xin, Hu, Yong, Deng, Yong, Mahadevan, Sankaran |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6505717/ https://www.ncbi.nlm.nih.gov/pubmed/24157896 http://dx.doi.org/10.1038/srep03049 |
Ejemplares similares
-
Modified box dimension and average weighted receiving time on the weighted fractal networks
por: Dai, Meifeng, et al.
Publicado: (2015) -
Retraction Note: Modified box dimension and average weighted receiving time on the weighted fractal networks
por: Dai, Meifeng, et al.
Publicado: (2020) -
On the Fractality of Complex Networks: Covering Problem, Algorithms and Ahlfors Regularity
por: Wang, Lihong, et al.
Publicado: (2017) -
Topological Vulnerability Evaluation Model Based on Fractal Dimension of Complex Networks
por: Gou, Li, et al.
Publicado: (2016) -
Fractal dimension for fractal structures: with applications to finance
por: Fernández-Martínez, Manuel, et al.
Publicado: (2019)