The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Small-world behavior in time-varying graphs
Open accessAbstract
Connections in complex networks are inherently fluctuating over time and exhibit more dimensionality than analysis based on standard static graph measures can capture. Here, we introduce the concepts of temporal paths and distance in time-varying graphs. We define as temporal small world a time-varying graph in which the links are highly clustered in time, yet the nodes are at small average temporal distances. We explore the small-world behavior in synthetic time-varying networks of mobile agents and in real social and biological time-varying systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Self-citationUnderstanding individual human mobility patterns
González, M. C., Hidalgo, C. A., & Barabási, A.-L. (2008) · Nature · doi:10.1038/nature06958 · Cited by 6,059
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Self-citationEvolution of the social network of scientific collaborations
Barabási, A. L., Jeong, H., Néda, Z., Ravasz, E., Schubert, A., & Vicsek, T. (2002) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(02)00736-7 · Cited by 1,972
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
Statistical mechanics of networks
Park, J., & Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066117 · Cited by 673
Connectivity and Inference Problems for Temporal Networks
Kempe, D., Kleinberg, J., & Kumar, A. (2002) · Journal of Computer and System Sciences · doi:10.1006/jcss.2002.1829 · Cited by 288
Recovering time-varying networks of dependencies in social and biological studies
Ahmed, A. A., & Xing, E. P. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0901910106 · Cited by 287
Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.79.036114 · Cited by 273
Scaling properties of scale-free evolving networks: Continuous approach
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review E · doi:10.1103/physreve.63.056125 · Cited by 258
Kostakos, V. (2009) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.11.021 · Cited by 254
Network reachability of real-world contact sequences
Holme, P. (2005) · Physical Review E · doi:10.1103/physreve.71.046119 · Cited by 213
Dynamical and bursty interactions in social networks
Stehlé, J., Barrat, A., & Bianconi, G. (2010) · Physical Review E · doi:10.1103/physreve.81.035101 · Cited by 177
Valencia, M., Martinerie, J. M., Dupont, S., & Chávez, M. (2008) · Physical Review E · doi:10.1103/physreve.77.050905 · Cited by 143
Microdynamics in stationary complex networks
Gautreau, A., Barrat, A., & Barthélemy, M. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0811113106 · Cited by 142
Persistence and periodicity in a dynamic proximity networkPreprint
Clauset, A. J., & Eagle, N. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1211.7343 · Cited by 141
Dynamics of directed graphs: the world-wide Web
Tadić, B. (2001) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(01)00014-0 · Cited by 125
Information super-diffusion on structured networks
Tadić, B., & Stefan Thurner, A. (2003) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2003.10.007 · Cited by 103
Disease spreading in populations of moving agents
Buscarino, A., Fortuna, L., Frasca, M., et al. (2008) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/82/38002 · Cited by 102
Dynamics of directed graphs: the world-wide Web
Tadić, B. (n.d.) · RePEc: Research Papers in Economics · Cited by 93
Extended Navigability of Small World Networks: Exact Results and New Insights
Cartozo, C. C., & Rios, P. D. L. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.238703 · Cited by 65
Fallani, F. D. V., Latora, V., Astolfi, L., Cincotti, F., Mattia, D., Marciani, M. G., Salinari, S., Colosimo, A., & Babiloni, F. (2008) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/41/22/224014 · Cited by 55
Self-citationBottleneck Genes and Community Structure in the Cell Cycle Network of S. pombe
Cartozo, C. C., Rios, P. D. L., Piazza, F., & Lió, P. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030103 · Cited by 27
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
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
“Similarly, for temporal networks, one may be interested in how quickly a vertex may on average reach other vertices, and define the temporal closeness centrality as [64]”
BackgroundInfluentialStructure and dynamics of molecular networks: A novel paradigm of drug discovery
Csermely, P., Korcsmáros, T., Kiss, H. J. M., London, G., & Nussinov, R. (2013) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2013.01.016 · Cited by 892
Time-varying graphs and dynamic networks
Casteigts, A., Flocchini, P., Quattrociocchi, W., & Santoro, N. (2012) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760.2012.668546 · Cited by 592
Emergence of network features from multiplexity
Cardillo, A., Gómez-Gardeñes, J., Zanin, M., Romance, M., Papo, D., Pozo, F. D., & Boccaletti, S. (2013) · Scientific Reports · doi:10.1038/srep01344 · Cited by 569
Metadata
- Authors
- Tang, J., Scellato, S., Musolesi, M., Mascolo, C., & Latora, V.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2010-05-17
- Volume
- 81
- Issue
- 5
- Pages
- 055101-055101
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2059763605
- Cited by
- 301
- References
- 26
- FWCI
- 19.87
- Type
- journal article
- Language
- en
- Open access
- green
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.