Evidence map›Paper›PMID 26054307›Full record

ArticleNature communications2015

Diffusion on networked systems is a question of time or structure.

Jean-Charles Delvenne, Renaud Lambiotte, Luis E C Rocha

Abstract read
PubMed Publisher
In one paragraph

Article in Nature communications, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 36 papers.

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

36 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. Article
  13. The shape of memory in temporal networks.Nature communications · 2022
    Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Integrated Computational Approaches and Tools forAllosteric Drug Discovery.International journal of molecular sciences · 2020
    Review
  20. Review
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

3 authors.

Jean-Charles DelvenneICTEAM and CORE, University of Louvain, 4 Avenue Lemaître, Louvain-la-Neuve B-1348, Belgium.
Renaud LambiotteDepartment of Mathematics and naXys, University of Namur, 8 Rempart de la Vierge, Namur B-5000, Belgium.ORCID 0000000205834595
Luis E C Rocha1] Department of Mathematics and naXys, University of Namur, 8 Rempart de la Vierge, Namur B-5000, Belgium [2] Department of Public Health Sciences, Karolinska Institutet, 18A Tomtebodavägen, Stockholm S-17177, Sweden.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Network science investigates the architecture of complex systems to understand their functional and dynamical properties. Structural patterns such as communities shape diffusive processes on networks. However, these results hold under the strong assumption that networks are static entities where temporal aspects can be neglected. Here we propose a generalized formalism for linear dynamics on complex networks, able to incorporate statistical properties of the timings at which events occur. We show that the diffusion dynamics is affected by the network community structure and by the temporal properties of waiting times between events. We identify the main mechanism--network structure, burstiness or fat tails of waiting times--determining the relaxation times of stochastic processes on temporal networks, in the absence of temporal-structure correlations. We identify situations when fine-scale structure can be discarded from the description of the dynamics or, conversely, when a fully detailed model is required due to temporal heterogeneities.

Identifiers

PMID26054307

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.