Laddar...
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...
Sparad:
| I publikationen: | Sci Rep |
|---|---|
| Huvudupphovsmän: | , , , , , , , |
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Nature Publishing Group
2017
|
| Ämnen: | |
| Länkar: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5269725/ https://ncbi.nlm.nih.gov/pubmed/28128289 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/srep41385 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|