The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Motifs in Temporal Networks
Open accessAbstract
Networks are a fundamental tool for modeling complex systems in a variety of domains including social and communication networks as well as biology and neuroscience. The counts of small subgraph patterns in networks, called network motifs, are crucial to understanding the structure and function of these systems. However, the role of network motifs for temporal networks, which contain many timestamped links between nodes, is not well understood.
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
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
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 · cited 3×
“Our work builds upon the rich literature on network motifs in static graphs, where these models have proved crucial to understanding the mechanisms driving complex systems [19] and to characterizing classes of static networks [25, 29].”
BackgroundHolme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736 · cited 1×
“However, many systems are not static as the links between objects dynamically change over time [8].”
BackgroundGraph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Self-citationEmpirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
Superfamilies of Evolved and Designed Networks
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004) · Science · doi:10.1126/science.1089167 · Cited by 1,412
Signed networks in social media
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1753326.1753532 · Cited by 1,306
Self-citationHigher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Self-citationFANMOD: a tool for fast network motif detection
Wernicke, S., & Rasche, F. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl038 · Cited by 745
Main-memory triangle computations for very large (sparse (power-law)) graphs
Latapy, M. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.07.017 · Cited by 458
A framework for community identification in dynamic social networks
Tantipathananandh, C., Berger-Wolf, T., & Kempe, D. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281269 · Cited by 443
Do the Rich Get Richer? An Empirical Analysis of the Bitcoin Transaction Network
Kondor, D., Pósfai, M., Csabai, I., & Vattay, G. (2014) · PLoS ONE · doi:10.1371/journal.pone.0086197 · Cited by 416
Patterns and dynamics of users' behavior and interaction: Network analysis of an online community
Panzarasa, P., Opsahl, T., & Carley, K. M. (2009) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21015 · Cited by 410
Temporal Link Prediction Using Matrix and Tensor Factorizations
Dunlavy, D. M., Kolda, T. G., & Acar, E. (2011) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1921632.1921636 · Cited by 375
Vázquez, A., Dobrin, R., Sergi, D., Eckmann, J.-P., Oltvai, Z. N., & Barabási, A.-L. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0406024101 · Cited by 346
Temporal motifs in time-dependent networks
Kovanen, L., Karsai, M., Kaski, K., Kertész, J., & Saramäki, J. (2011) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2011/11/p11005 · Cited by 296
Evidence for a bimodal distribution in human communication
Wu, Y., Zhou, C., Xiao, J., Kurths, J., & Schellnhuber, H. J. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1013140107 · Cited by 269
Revealing the Hidden Language of Complex Networks
Yaveroğlu, Ö. N., Malod-Dognin, N., Davis, D., Levnajic, Z., Janjic, V., Karapandza, R., Stojmirovic, A., & Pržulj, N. (2014) · Scientific Reports · doi:10.1038/srep04547 · Cited by 247
Berlingerio, M., Bonchi, F., Bringmann, B., & Gionis, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04180-8_25 · Cited by 174
Tensor Spectral Clustering for Partitioning Higher-order Network Structures
Benson, A. R., Gleich, D. F., & Leskovec, J. (2015) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611974010.14 · Cited by 146
Self-citationCom2: Fast Automatic Discovery of Temporal (‘Comet’) Communities
Araújo, M. R., Papadimitriou, S., Günnemann, S., Faloutsos, C., Basu, P., Swami, A., Papalexakis, E. E., & Koutra, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06605-9_23 · Cited by 91
Communication motifs: a tool to characterize social communications
Zhao, Q., Tian, Y., He, Q., Oliver, N., Jin, R., & Lee, W.-C. (2010) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1871437.1871694 · Cited by 90
COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks
Gurukar, S., Ranu, S., & Ravindran, B. (2015) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2723372.2737791 · Cited by 74
Mining triadic closure patterns in social networks
Huang, H., Tang, J., Wu, S., Liu, L., & Fu, X. (2014) · International World Wide Web Conference (WWW) · doi:10.1145/2567948.2576940 · Cited by 67
Cited by
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
Self-citationFrom networks to optimal higher-order models of complex systems
Lambiotte, R., Rosvall, M., & Scholtes, I. (2019) · Nature Physics · doi:10.1038/s41567-019-0459-y · Cited by 483
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
Group interactions modulate critical mass dynamics in social convention
Iacopini, I., Petri, G., Baronchelli, A., & Barrat, A. (2022) · Communications Physics · doi:10.1038/s42005-022-00845-y · Cited by 69
Metadata
- Authors
- Paranjape, A., Benson, A. R., & Leskovec, J.
- Venue
- Proceedings of the Tenth ACM International Conference on Web Search and Data Mining
- Publisher
- ACM
- Published
- 2017-02-02
- Pages
- 601-610
- OpenAlex
- W2562676961
- Cited by
- 540
- References
- 26
- FWCI
- 48.50
- Type
- conference paper
- 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.