Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An embedding-based distance for temporal graphs (2401.12843v3)

Published 23 Jan 2024 in cs.SI, cs.LG, and physics.soc-ph

Abstract: Temporal graphs are commonly used to represent time-resolved relations between entities in many natural and artificial systems. Many techniques were devised to investigate the evolution of temporal graphs by comparing their state at different time points. However, quantifying the similarity between temporal graphs as a whole is an open problem. Here, we use embeddings based on time-respecting random walks to introduce a new notion of distance between temporal graphs. This distance is well-defined for pairs of temporal graphs with different numbers of nodes and different time spans. We study the case of a matched pair of graphs, when a known relation exists between their nodes, and the case of unmatched graphs, when such a relation is unavailable and the graphs may be of different sizes. We use empirical and synthetic temporal network data to show that the distance we introduce discriminates graphs with different topological and temporal properties. We provide an efficient implementation of the distance computation suitable for large-scale temporal graphs.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (83)
  1. Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
  2. Mark EJ Newman. The structure and function of complex networks. SIAM review, 45(2):167–256, 2003.
  3. Dynamical processes on complex networks. Cambridge University Press, Cambridge, 2008.
  4. John Scott. Trend report social network analysis. Sociology, pages 109–127, 1988.
  5. Social Network Analysis: Methods and Applications. Structural Analysis in the Social Sciences. Cambridge University Press, 1994.
  6. Classes of small-world networks. Proceedings of the national academy of sciences, 97(21):11149–11152, 2000.
  7. Marc Barthélemy. Spatial networks. Physics reports, 499(1-3):1–101, 2011.
  8. Biological networks. Current opinion in structural biology, 13(2):193–202, 2003.
  9. Temporal networks. Physics reports, 519(3):97–125, 2012.
  10. T-gcn: A temporal graph convolutional network for traffic prediction. IEEE transactions on intelligent transportation systems, 21(9):3848–3858, 2019.
  11. Temporal dynamics and network analysis. Methods in Ecology and Evolution, 3(6):958–972, 2012.
  12. Dynamics of person-to-person interactions from distributed rfid sensor networks. PloS one, 5(7):e11596, 2010.
  13. Empirical temporal networks of face-to-face human interactions. The European Physical Journal Special Topics, 222(6):1295–1309, 2013.
  14. Temporal networks of face-to-face human interactions. In Temporal Networks, pages 191–216. Springer, 2013.
  15. Gender and collaboration patterns in a temporal scientific authorship network. Applied Network Science, 4(1):1–17, 2019.
  16. Tracking the evolution of temporal patterns of usage in bicycle-sharing systems using nonnegative matrix factorization on multiple sliding windows. International Journal of Urban Sciences, 22(2):147–161, 2018.
  17. The spatio-temporal development of copenhagen’s bicycle infrastructure 1912–2013. Geografisk Tidsskrift-Danish Journal of Geography, 115(2):142–156, 2015.
  18. Metric learning. Synthesis lectures on artificial intelligence and machine learning, 9(1):1–151, 2015.
  19. Metrics for graph comparison: a practitioner’s guide. Plos one, 15(2):e0228728, 2020.
  20. Comparing methods for comparing networks. Scientific reports, 9(1):1–19, 2019.
  21. Network comparison and the within-ensemble graph distance. Proc. R. Soc. A, 476:20190744, 2020.
  22. A survey on embedding dynamic graphs. ACM Computing Surveys (CSUR), 55(1):1–37, 2021.
  23. Deep graph similarity learning: A survey. Data Mining and Knowledge Discovery, 35(3):688–725, 2021.
  24. A distance measure between attributed relational graphs for pattern recognition. IEEE transactions on systems, man, and cybernetics, (3):353–362, 1983.
  25. Applied dynamic programming, volume 2050. Princeton university press, 2015.
  26. Deltacon: A principled massive-graph similarity function. In Proceedings of the 2013 SIAM international conference on data mining, pages 162–170. SIAM, 2013.
  27. The resistance perturbation distance: A metric for the analysis of dynamic networks. Discrete Applied Mathematics, 236:347–386, 2018.
  28. Netsimile: A scalable approach to size-independent network similarity. arXiv preprint arXiv:1209.2684, 2012.
  29. An information-theoretic, all-scales approach to comparing networks. Applied Network Science, 4(1):1–15, 2019.
  30. Neural Nets WIRN10 B Apolloni et al. An introduction to spectral distances in networks. In Neural Nets WIRN10: Proceedings of the 20th Italian Workshop on Neural Nets, volume 226, page 227. IOS Press, 2011.
  31. Graph distance for complex networks. Scientific reports, 6(1):1–6, 2016.
  32. Graph distance from the topological view of non-backtracking cycles. arXiv preprint arXiv:1807.09592, 2018.
  33. Netlsd: hearing the shape of a graph. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 2347–2356, 2018.
  34. Tracking network dynamics: A survey using graph distances. The Annals of Applied Statistics, 12(2):971–1012, 2018.
  35. Detecting sequences of system states in temporal networks. Scientific reports, 9(1):1–11, 2019.
  36. Detecting social (in) stability in primates from their temporal co-presence network. Animal Behaviour, 157:239–254, 2019.
  37. Dynamic core-periphery structure of information sharing networks in entorhinal cortex and hippocampus. Network Neuroscience, 4(3):946–975, 2020.
  38. Flow of temporal network properties under local aggregation and time shuffling: a tool for characterizing, comparing and classifying temporal networks. arXiv preprint arXiv:2310.09112, 2023.
  39. Comparing temporal graphs using dynamic time warping. Social Network Analysis and Mining, 10(1):1–16, 2020.
  40. Measuring and utilizing temporal network dissimilarity. arXiv preprint arXiv:2111.01334, 2021.
  41. Community discovery in dynamic networks: a survey. ACM computing surveys (CSUR), 51(2):1–37, 2018.
  42. Metric structures for Riemannian and non-Riemannian spaces, volume 152. Springer, 1999.
  43. A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE Transactions on Knowledge and Data Engineering, 30(9):1616–1637, 2018.
  44. Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems, 151:78–94, 2018.
  45. Mengjia Xu. Understanding graph embedding methods and their applications. SIAM Review, 63(4):825–853, 2021.
  46. Survey on graph embeddings and their applications to machine learning problems on graphs. PeerJ Computer Science, 7:e357, 2021.
  47. Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach. PloS one, 9(1):e86028, 2014.
  48. Evolutionary spectral clustering by incorporating temporal smoothness. In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 153–162, 2007.
  49. A multi-similarity spectral clustering method for community detection in dynamic networks. Scientific reports, 6(1):1–11, 2016.
  50. Global spectral clustering in dynamic networks. Proceedings of the National Academy of Sciences, 115(5):927–932, 2018.
  51. Adaptive evolutionary clustering. Data Mining and Knowledge Discovery, 28(2):304–336, 2014.
  52. Community detection in sparse time-evolving graphs with a dynamical bethe-hessian. Advances in Neural Information Processing Systems, 33:7486–7497, 2020.
  53. Embedding temporal network via neighborhood formation. In Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pages 2857–2866, 2018.
  54. Continuous-time dynamic network embeddings. In Companion proceedings of the the web conference 2018, pages 969–976, 2018.
  55. Predicting partially observed processes on temporal networks by dynamics-aware node embeddings (dyane). EPJ Data Science, 10(1):22, 2021.
  56. Efficient distributed representations beyond negative sampling. arXiv preprint arXiv:2303.17475, 2023.
  57. On the evolution of random graphs. Publ. math. inst. hung. acad. sci, 5(1):17–60, 1960.
  58. Stochastic blockmodels and community structure in networks. Physical review E, 83(1):016107, 2011.
  59. Béla Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1(4):311–316, 1980.
  60. Random geometric graphs. Physical review E, 66(1):016121, 2002.
  61. Algorithms for nonnegative matrix factorization with the β𝛽\betaitalic_β-divergence. Neural computation, 23(9):2421–2456, 2011.
  62. James MacQueen et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, pages 281–297. Oakland, CA, USA, 1967.
  63. Parametric umap embeddings for representation and semisupervised learning. Neural Computation, 33(11):2881–2907, 2021.
  64. Randomized reference models for temporal networks. SIAM Review, 64(4):763–830, 2022.
  65. Path lengths, correlations, and centrality in temporal networks. Phys. Rev. E, 84:016105, Jul 2011.
  66. Generative adversarial nets. Advances in neural information processing systems, 27, 2014.
  67. Deep graph generators: A survey. IEEE Access, 9:106675–106702, 2021.
  68. Applications of generative adversarial networks (gans): An updated review. Archives of Computational Methods in Engineering, 28:525–552, 2021.
  69. An infectious disease model on empirical networks of human contact: bridging the gap between dynamic network data and contact matrices. BMC Infectious Diseases, 13(1):1–18, 2013.
  70. Mitigation of infectious disease at school: targeted class closure vs school closure. BMC infectious diseases, 14(1):1–10, 2014.
  71. Inferring high-resolution human mixing patterns for disease modeling. Nature communications, 12(1):323, 2021.
  72. Digital proximity tracing on empirical contact networks for pandemic control. Nature communications, 12(1):1655, 2021.
  73. Interaction data are identifiable even across long periods of time. Nature Communications, 13(1):313, 2022.
  74. Screening and vaccination against covid-19 to minimise school closure: a modelling study. The Lancet Infectious Diseases, 22(7):977–989, 2022.
  75. Wherefore art thou r3579x? anonymized social networks, hidden patterns, and structural steganography. In Proceedings of the 16th international conference on World Wide Web, pages 181–190, 2007.
  76. Privacy and uniqueness of neighborhoods in social networks. Scientific reports, 11(1):20104, 2021.
  77. High-resolution measurements of face-to-face contact patterns in a primary school. PloS one, 6(8):e23176, 2011.
  78. Contact patterns among high school students. PLoS ONE, 9(9):e107878, 09 2014.
  79. Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys. PloS one, 10(9):e0136497, 2015.
  80. Measuring social networks in primates: wearable sensors versus direct observations. Proceedings of the Royal Society A, 476(2236):20190737, 2020.
  81. Using wearable proximity sensors to characterize social contact patterns in a village of rural malawi. EPJ Data Science, 10(1):46, 2021.
  82. Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PLoS ONE, 8:e73970, 09 2013.
  83. Can co-location be used as a proxy for face-to-face contacts? EPJ Data Science, 7(1):1–18, 2018.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now