Fetching the paper…
Reading the bibliography…
One fundamental problem in temporal graph analysis is to count the occurrences of small connected subgraph patterns (i.e., motifs), which benefits a broad range of real-world applications, such as anomaly detection, structure prediction, and network representation learning.
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: simple building blocks of complex networks,” Science , vol. 298, no. 5594, pp. 824–827, 2002
2002
Earlier work this paper cites.
A. Vazquez, R. Dobrin, D. Sergi, J.-P. Eckmann, Z. N. Oltvai, and A.-L. Barabási, “The topological relationship between the large-scale attributes and local interaction patterns of complex networks,” Proceedings of the National Academy of Sciences , vol. 101, no. 52, pp. 17 940–17 945, 2004
2004
Earlier work this paper cites.
N. Pržulj, “Biological network comparison using graphlet degree distribution,” Bioinformatics , vol. 23, no. 2, pp. e177–e183, 2007
2007
Earlier work this paper cites.
M. Latapy, “Main-memory triangle computations for very large (sparse (power-law)) graphs,” Theoretical Computer ence , vol. 407, no. 1-3, pp. 458–473, 2008
2008
Earlier work this paper cites.
C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos, “Doulion: counting triangles in massive graphs with a coin,” in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining , 2009, pp. 837–846
2009
Earlier work this paper cites.
Q. Zhao, Y. Tian, Q. He, N. Oliver, R. Jin, and W.-C. Lee, “Communication motifs: a tool to characterize social communications,” in Proceedings of the 19th ACM international conference on Information and knowledge management , 2010, pp. 1645–1648
2010
Earlier work this paper cites.
L. Kovanen, M. Karsai, K. Kaski, J. Kertész, and J. Saramäki, “Temporal motifs in time-dependent networks,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2011, no. 11, p. P11005, 2011
2011
Earlier work this paper cites.
P. Holme and J. Saramäki, “Temporal networks,” Physics Reports , vol. 519, no. 3, pp. 97–125, 2012, temporal Networks. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0370157312000841
2012
Earlier work this paper cites.
Y. Hu, J. Trousdale, K. Josić, and E. Shea-Brown, “Motif statistics and spike correlations in neuronal networks,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2013, no. 03, p. P03012, 2013
2013
Earlier work this paper cites.
A. Pavan, S. Tirthapura et al. , “Counting and sampling triangles from a graph stream,” 2013
2013
Earlier work this paper cites.
Ö. N. Yaveroğlu, N. Malod-Dognin, D. Davis, Z. Levnajic, V. Janjic, R. Karapandza, A. Stojmirovic, and N. Pržulj, “Revealing the hidden language of complex networks,” Scientific reports , vol. 4, no. 1, pp. 1–9, 2014
2014
Earlier work this paper cites.
N. K. Ahmed, N. Duffield, J. Neville, and R. Kompella, “Graph sample and hold: A framework for big-graph analytics,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 1446–1455
2014
Earlier work this paper cites.
J. Leskovec and A. Krevl, “SNAP Datasets: Stanford large network dataset collection,” http://snap.stanford.edu/data , Jun. 2014
2014
Earlier work this paper cites.
L. Akoglu, H. Tong, and D. Koutra, “Graph based anomaly detection and description: a survey,” Data mining and knowledge discovery , vol. 29, no. 3, pp. 626–688, 2015
2015
Cited alongside, same era.
S. Gurukar, S. Ranu, and B. Ravindran, “Commit: A scalable approach to mining communication motifs from dynamic networks,” in Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data , 2015, pp. 475–489
2015
Cited alongside, same era.
A. R. Benson, D. F. Gleich, and J. Leskovec, “Tensor spectral clustering for partitioning higher-order network structures,” in Proceedings of the 2015 SIAM International Conference on Data Mining . SIAM, 2015, pp. 118–126
2015
Cited alongside, same era.
N. K. Ahmed, J. Neville, R. A. Rossi, and N. Duffield, “Efficient graphlet counting for large networks,” in 2015 IEEE International Conference on Data Mining (ICDM) , 2015
2015
Cited alongside, same era.
Y. Yu, Z. Lu, J. Liu, G. Zhao, and J.-r. Wen, “Rum: Network representation learning using motifs,” in 2019 IEEE 35th International Conference on Data Engineering (ICDE) . IEEE, 2019, pp. 1382–1393
2019
Later among the works it cites.
P. Liu, A. R. Benson, and M. Charikar, “Sampling methods for counting temporal motifs,” in Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining , 2019, pp. 294–302
2019
Later among the works it cites.
X. Sun, Y. Tan, Q. Wu, B. Chen, and C. Shen, “Tm-miner: Tfs-based algorithm for mining temporal motifs in large temporal network,” IEEE Access , vol. 7, pp. 49 778–49 789, 2019
2019
Later among the works it cites.
A. Turk and D. Turkoglu, “Revisiting wedge sampling for triangle counting,” in The World Wide Web Conference , 2019, pp. 1875–1885
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. A. Rossi and N. K. Ahmed, “The network data repository with interactive graph analytics and visualization,” in AAAI , 2015. [Online]. Available: https://networkrepository.com
2015
Cited alongside, same era.
——, “Higher-order organization of complex networks,” Science , vol. 353, no. 6295, pp. 163–166, 2016
2016
Cited alongside, same era.
A. Paranjape, A. R. Benson, and J. Leskovec, “Motifs in temporal networks,” in Proceedings of the tenth ACM international conference on web search and data mining , 2017, pp. 601–610
2017
Cited alongside, same era.
P. Wang, J. Zhao, X. Zhang, Z. Li, J. Cheng, J. C. Lui, D. Towsley, J. Tao, and X. Guan, “Moss-5: A fast method of approximating counts of 5-node graphlets in large graphs,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 1, pp. 73–86, 2017
2017
Cited alongside, same era.
S. Jain and C. Seshadhri, “A fast and provable method for estimating clique counts using turán’s theorem,” in Proceedings of the 26th international conference on world wide web , 2017, pp. 441–449
2017
Cited alongside, same era.
C. Yang, M. Liu, V. W. Zheng, and J. Han, “Node, motif and subgraph: Leveraging network functional blocks through structural convolution,” in 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) . IEEE, 2018, pp. 47–52
2018
Cited alongside, same era.
R. Kumar and T. Calders, “2scent: an efficient algorithm for enumerating all simple temporal cycles,” Proceedings of the VLDB Endowment , vol. 11, no. 11, pp. 1441–1453, 2018
2018
Cited alongside, same era.
P. Mackey, K. Porterfield, E. Fitzhenry, S. Choudhury, and G. Chin, “A chronological edge-driven approach to temporal subgraph isomorphism,” in 2018 IEEE International Conference on Big Data (Big Data) . IEEE, 2018, pp. 3972–3979
2018
Cited alongside, same era.
N. Ahmed, R. A. Rossi, J. Lee, T. Willke, R. Zhou, X. Kong, and H. Eldardiry, “Role-based graph embeddings,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Later among the works it cites.
Y. Fang, X. Huang, L. Qin, Y. Zhang, W. Zhang, R. Cheng, and X. Lin, “A survey of community search over big graphs,” The VLDB Journal , vol. 29, no. 1, pp. 353–392, 2020
2020
Later among the works it cites.
H. Huang, Z. Fang, X. Wang, Y. Miao, and H. Jin, “Motif-preserving temporal network embedding.” in IJCAI , 2020, pp. 1237–1243
2020
Later among the works it cites.
Y. Jin, G. Song, and C. Shi, “Gralsp: Graph neural networks with local structural patterns,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 4361–4368
2020
Later among the works it cites.
J. Wang, Y. Wang, W. Jiang, Y. Li, and K.-L. Tan, “Efficient sampling algorithms for approximate temporal motif counting,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management , 2020, pp. 1505–1514
2020
Later among the works it cites.
Y. Santoso, V. Srinivasan, and A. Thomo, “Efficient enumeration of four node graphlets at trillion-scale.” in EDBT , 2020, pp. 439–442
2020
Later among the works it cites.
S. K. Bera and C. Seshadhri, “How to count triangles, without seeing the whole graph,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , ser. KDD ’20. New York, NY, USA: Association for Computing Machinery, 2020, p. 306–316. [Online]. Available: https://doi.org/10.1145/3394486.3403073
2020
Later among the works it cites.
P. Liu, V. Guarrasi, and A. E. Sariyuce, “Temporal network motifs: Models, limitations, evaluation,” IEEE Transactions on Knowledge and Data Engineering , 2021
2021
Later among the works it cites.
Z. Liu, C. Huang, Y. Yu, and J. Dong, “Motif-preserving dynamic attributed network embedding,” in Proceedings of the Web Conference 2021 , 2021, pp. 1629–1638
2021
Later among the works it cites.