Evidence map›Paper›PMID 34692113›Full record

ArticleNational science review2020

Predictability of real temporal networks.

Disheng Tang, Wenbo Du, Louis Shekhtman, Yijie Wang, Shlomo Havlin, Xianbin Cao, Gang Yan

Abstract read
In one paragraph

Article in National science review, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

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

8 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Review
  6. Dynamic activity chain pattern estimation under mobility demand changes during COVID-19.Transportation research. Part C, Emerging technologies · 2021
    Article
  7. Article
  8. 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

7 authors.

Disheng TangSchool of Electronic and Information Engineering, Beihang University, Beijing 100191, China.
Wenbo DuSchool of Electronic and Information Engineering, Beihang University, Beijing 100191, China.
Louis ShekhtmanNetwork Science Institute, Northeastern University, Boston, MA 02115, USA.
Yijie WangSchool of Electronic and Information Engineering, Beihang University, Beijing 100191, China.
Shlomo HavlinDepartment of Physics, Bar Ilan University, Ramat Gan 5290002, Israel.
Xianbin CaoSchool of Electronic and Information Engineering, Beihang University, Beijing 100191, China.
Gang YanSchool of Physics Science and Engineering, Tongji University, Shanghai 200092, China.ORCID 0000-0001-6196-2615

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Links in most real networks often change over time. Such temporality of links encodes the ordering and causality of interactions between nodes and has a profound effect on network dynamics and function. Empirical evidence has shown that the temporal nature of links in many real-world networks is not random. Nonetheless, it is challenging to predict temporal link patterns while considering the entanglement between topological and temporal link patterns. Here, we propose an entropy-rate-based framework, based on combined topological-temporal regularities, for quantifying the predictability of any temporal network. We apply our framework on various model networks, demonstrating that it indeed captures the intrinsic topological-temporal regularities whereas previous methods considered only temporal aspects. We also apply our framework on 18 real networks of different types and determine their predictability. Interestingly, we find that, for most real temporal networks, despite the greater complexity of predictability brought by the increase in dimension, the combined topological-temporal predictability is higher than the temporal predictability. Our results demonstrate the necessity for incorporating both temporal and topological aspects of networks in order to improve predictions of dynamical processes.

Indexed as

network entropypredictabilitypredictive algorithmtemporal network

Identifiers

PMID34692113
PMCPMC8288877

What OpenQuestion holds

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