The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Random walks on temporal networks
Open accessAbstract
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various time scales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis of the temporal patterns characterizing dynamic networks are still recent, so that many questions remain open. Here, we study how random walks, as a paradigm of dynamical processes, unfold on temporally evolving networks. To this aim, we use empirical dynamical networks of contacts between individuals, and characterize the fundamental quantities that impact any general process taking place upon them. Furthermore, we introduce different randomizing strategies that allow us to single out the role of the different properties of the empirical networks. We show that the random walk exploration is slower on temporal networks than it is on the aggregate projected network, even when the time is properly rescaled. In particular, we point out that a fundamental role is played by the temporal correlations between consecutive contacts present in the data. Finally, we address the consequences of the intrinsically limited duration of many real world dynamical networks. Considering the fundamental prototypical role of the random walk process, we believe that these results could help to shed light on the behavior of more complex dynamics on temporally evolving networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,993
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
The architecture of complex weighted networks
Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400087101 · Cited by 4,218
Self-citationDynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 2×
“Here, we study how random walks, as paradigm of dynamical processes, unfold on temporally evolving networks.”
BackgroundSelf-citationA measure of betweenness centrality based on random walks
Newman, M. E. J. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.009 · Cited by 2,461
The origin of bursts and heavy tails in human dynamics
Barabási, A.-L. (2005) · Nature · doi:10.1038/nature03459 · Cited by 2,210
Structure and tie strengths in mobile communication networks
Onnela, J.-P., Saramäki, J., Hyvönen, J., Szabó, G., Lazer, D., Kaski, K., Kertész, J., & Barabási, A.-L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610245104 · Cited by 1,926
Adamic, L. A., Lukose, R. M., Puniyani, A. R., & Huberman, B. A. (2001) · Physical Review E · doi:10.1103/physreve.64.046135 · Cited by 1,203
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Self-citationModern temporal network theory: a colloquium
Holme, P. (2015) · The European Physical Journal B · doi:10.1140/epjb/e2015-60657-4 · Cited by 734
Random walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
Coupled disease–behavior dynamics on complex networks: A review
Wang, Z., Andrews, M. A., Wu, Z.-X., Wang, L., & Bauch, C. T. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.07.006 · Cited by 546
The fundamental advantages of temporal networks
Li, A., Cornelius, S. P., Liu, Y.-Y., Wang, L., & Barabási, A.-L. (2017) · Science · doi:10.1126/science.aai7488 · Cited by 495
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W., Tian, Y., Hens, C., Perc, M., Tang, Y., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 360
Multilayer Networks: Structure and Function
Bianconi, G. (2018) · doi:10.1093/oso/9780198753919.001.0001 · Cited by 334
Time varying networks and the weakness of strong ties
Karsai, M., Perra, N., & Vespignani, A. (2014) · Scientific Reports · doi:10.1038/srep04001 · Cited by 308
Causality-driven slow-down and speed-up of diffusion in non-Markovian temporal networks
Scholtes, I., Wider, N., Pfitzner, R., Garas, A., Tessone, C. J., & Schweitzer, F. (2014) · Nature Communications · doi:10.1038/ncomms6024 · Cited by 304
Metadata
- Authors
- Starnini, M., Baronchelli, A., Barrat, A., & Pastor-Satorras, R.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2012-05-18
- Volume
- 85
- Issue
- 5
- Pages
- 056115-056115
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2151722633
- Cited by
- 275
- References
- 39
- FWCI
- 13.38
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.