Evidence map›Paper›PMID 24157896›Full record

ArticleScientific reports2013

Box-covering algorithm for fractal dimension of weighted networks.

Dai-Jun Wei, Qi Liu, Hai-Xin Zhang, Yong Hu, Yong Deng, Sankaran Mahadevan

Abstract read
In one paragraph

Article in Scientific reports, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers.

0numbers the graph read from it
0cells of the map it votes in
15citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

15 citing papers in PubMed.

  1. Article
  2. Article
  3. An Extended Correlation Dimension of Complex Networks.Entropy (Basel, Switzerland) · 2021
    Article
  4. Article
  5. Article
  6. Article
  7. Review
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors.

Dai-Jun Wei1] School of Computer and Information Science, Southwest University, Chongqing 400715, China [2] School of Science, Hubei University for Nationalities, Enshi 445000, China.
Qi Liu
Hai-Xin Zhang
Yong Hu
Yong Deng
Sankaran Mahadevan

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

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 size length is obtained by accumulating the distance between two nodes connected directly and graph-coloring algorithm is based on the node strength. The proposed method is applied to calculate the fractal dimensions of the "Sierpinski" weighted fractal networks, the E.coli network, the Scientific collaboration network, the C.elegans network and the USAir97 network. Our results show that the proposed method is efficient when dealing with the fractal dimension problem of complex networks. We find that the fractal property is influenced by the edge-weight in weighted networks. The possible variation of fractal dimension due to changes in edge-weights of weighted networks is also discussed.

Indexed as

AlgorithmsModels, Theoretical

Identifiers

PMID24157896
PMCPMC6505717

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-SA
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.