Evidence map›Paper›PMID 25659742›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2015

Toward link predictability of complex networks.

Linyuan Lü, Liming Pan, Tao Zhou, Yi-Cheng Zhang, H Eugene Stanley

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 62 papers.

0numbers the graph read from it
0cells of the map it votes in
62citing 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

62 citing papers in PubMed.

  1. Predictability of complex networks.Proceedings of the National Academy of Sciences of the United States of America · 2026
    Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Review
  10. Article
  11. Review
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. How regularly do people visit service places?Computers, environment and urban systems · 2023
    Article
  18. Article
  19. Article
  20. Article

2 more citing papers are in PubMed but not listed here.

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

5 authors.

Linyuan LüAlibaba Research Center for Complexity Sciences, Alibaba Business College, Hangzhou Normal University, Hangzhou 311121, China; hes@bu.edu linyuan.lv@hznu.edu.cn yi-cheng.zhang@unifr.ch.
Liming PanAlibaba Research Center for Complexity Sciences, Alibaba Business College, Hangzhou Normal University, Hangzhou 311121, China; CompleX Lab, Web Sciences Center and.
Tao ZhouCompleX Lab, Web Sciences Center and Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, China;
Yi-Cheng ZhangAlibaba Research Center for Complexity Sciences, Alibaba Business College, Hangzhou Normal University, Hangzhou 311121, China; Department of Physics, University of Fribourg, Fribourg CH-1700, Switzerland; and hes@bu.edu linyuan.lv@hznu.edu.cn yi-cheng.zhang@unifr.ch.
H Eugene StanleyAlibaba Research Center for Complexity Sciences, Alibaba Business College, Hangzhou Normal University, Hangzhou 311121, China; Department of Physics and Center for Polymer Studies, Boston University, Boston, MA 02215 hes@bu.edu linyuan.lv@hznu.edu.cn yi-cheng.zhang@unifr.ch.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The organization of real networks usually embodies both regularities and irregularities, and, in principle, the former can be modeled. The extent to which the formation of a network can be explained coincides with our ability to predict missing links. To understand network organization, we should be able to estimate link predictability. We assume that the regularity of a network is reflected in the consistency of structural features before and after a random removal of a small set of links. Based on the perturbation of the adjacency matrix, we propose a universal structural consistency index that is free of prior knowledge of network organization. Extensive experiments on disparate real-world networks demonstrate that (i) structural consistency is a good estimation of link predictability and (ii) a derivative algorithm outperforms state-of-the-art link prediction methods in both accuracy and robustness. This analysis has further applications in evaluating link prediction algorithms and monitoring sudden changes in evolving network mechanisms. It will provide unique fundamental insights into the above-mentioned academic research fields, and will foster the development of advanced information filtering technologies of interest to information technology practitioners.

Indexed as

complex networkslink predictionpredictabilitystructural perturbation

Identifiers

PMID25659742
PMCPMC4345601

What OpenQuestion holds

Textmetadata
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.