The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Temporal motifs in time-dependent networks
Open accessAbstract
Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as telecommunication, neural signal processing, biochemical reaction and human social interaction networks. We introduce the framework of temporal motifs to study the mesoscale topological–temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to coloured directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network.
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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Network motifs in the transcriptional regulation network of Escherichia coli
Shen-Orr, S. S., Milo, R., Mangan, S., & Alon, U. (2002) · Nature Genetics · doi:10.1038/ng881 · Cited by 2,952
The spread of behavior in an online social network experiment
Centola, D. (2010) · Science · doi:10.1126/science.1185231 · Cited by 2,692
The Structure and Dynamics of Networks
Newman, M., Barabási, A.-L., & Watts, D. J. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356 · Cited by 2,268
Intensity and coherence of motifs in weighted complex networks
Onnela, J.-P., Saramäki, J., Kertész, J., & Kaski, K. (2005) · Physical Review E · doi:10.1103/physreve.71.065103 · Cited by 1,112
Self-citationSmall but slow world: How network topology and burstiness slow down spreading
Karsai, M., Kivelä, M., Pan, R. K., Kaski, K., Kertész, J., Barabási, A.-L., & Saramäki, J. (2011) · Physical Review E · doi:10.1103/physreve.83.025102 · Cited by 668
Self-citationImpact of Human Activity Patterns on the Dynamics of Information Diffusion
Iribarren, J. L., & Moro, E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.038702 · Cited by 413
COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
Bui-Xuan, B.-M., Ferreira, A., & Jarry, A. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103001728 · Cited by 376
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
Self-citationNetworks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
A survey of results on mobile phone datasets analysis
Blondel, V. D., Decuyper, A., & Krings, G. (2015) · EPJ Data Science · doi:10.1140/epjds/s13688-015-0046-0 · Cited by 647
Unravelling daily human mobility motifs
Schneider, C. M., Belik, V., Couronné, T., Smoreda, Z., & González, M. C. (2013) · Journal of The Royal Society Interface · doi:10.1098/rsif.2013.0246 · Cited by 585
Community Discovery in Dynamic Networks: A Survey
Rossetti, G., & Cazabet, R. (2019) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 468
Metadata
- Authors
- Kovanen, L., Karsai, M., Kaski, K., Kertész, J., & Saramäki, J.
- Venue
- Journal of Statistical Mechanics: Theory and Experiment
- Publisher
- IOP Publishing
- Published
- 2011-11-01
- Volume
- 2011
- Issue
- 11
- Pages
- P11005
- ISSN
- 1742-5468 (ISSN-L)
- OpenAlex
- W2029792996
- Cited by
- 296
- References
- 28
- FWCI
- 11.20
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Temporal motifs in time-dependent networks. https://app.cochat.ai/papers/10.1088/1742-5468/2011/11/p11005
- The paper
- Kovanen, L., Karsai, M., Kaski, K., Kertész, J., & Saramäki, J. (2011). Temporal motifs in time-dependent networks. Journal of Statistical Mechanics: Theory and Experiment. https://doi.org/10.1088/1742-5468/2011/11/p11005
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.