Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 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

Approximating Simplet Frequency Distribution for Simplicial Complexes (2402.16777v1)

Published 26 Feb 2024 in cs.CG, cs.CC, and math.GT

Abstract: Simplets, constituting elementary units within simplicial complexes (SCs), serve as foundational elements for the structural analysis of SCs. Previous efforts have focused on the exact count or approximation of simplet count rather than their frequencies, with the latter being more practical in large-scale SCs. This paper enables simplet frequency analysis of SCs by introducing the Simplet Frequency Distribution (SFD) vector. In addition, we present a bound on the sample complexity required for accurately approximating the SFD vector by any uniform sampling-based algorithm. We also present a simple algorithm for this purpose and justify the theoretical bounds with experiments on some random simplicial complexes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. Uri Alon. Network motifs: theory and experimental approaches. Nature Reviews Genetics, 8(6):450–461, 2007.
  2. Understanding the characteristics of covid-19 misinformation communities through graphlet analysis. Online Social Networks and Media, 27:100178, 2022.
  3. Predicting virality on networks using local graphlet frequency distribution. In 2018 IEEE International Conference on Big Data (Big Data), pages 2475–2482. IEEE, 2018.
  4. Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences, 115(48):E11221–E11230, 2018.
  5. Guise: Uniform sampling of graphlets for large graph analysis. In 2012 IEEE 12th International Conference on Data Mining, pages 91–100. IEEE, 2012.
  6. Ginestra Bianconi. Higher-order networks. Cambridge University Press, 2021.
  7. Marco Bressan. Efficient and near-optimal algorithms for sampling small connected subgraphs. ACM Transactions on Algorithms, 19(3):1–40, 2023.
  8. Counting graphlets: Space vs time. In Proceedings of ACM International Conference on Web Search and Data Mining, pages 557–566, 2017.
  9. Motif counting beyond five nodes. ACM Transactions on Knowledge Discovery from Data, 12(4):1–25, 2018.
  10. Alexander Douglas et al. Exploring how graphlet analysis can be used to identify highly-connected cancer driving genes. PhD thesis, University of Northern British Columbia, 2022.
  11. Herbert Edelsbrunner. A short course in computational geometry and topology. Springer, 2014.
  12. Centralities in simplicial complexes. applications to protein interaction networks. Journal of theoretical biology, 438:46–60, 2018.
  13. Jakob Jonsson. Simplicial complexes of graphs, volume 3. Springer, 2008.
  14. Characterization of simplicial complexes by counting simplets beyond four nodes. In Proceedings of the ACM Web Conference 2023, pages 317–327, 2023.
  15. Graph evolution: Densification and shrinking diameters. ACM transactions on Knowledge Discovery from Data (TKDD), 1(1):2–es, 2007.
  16. Markov chains and mixing times, volume 107. American Mathematical Soc., 2017.
  17. Contagion in simplicial complexes. Chaos, Solitons & Fractals, 152:111307, 2021.
  18. Insights into brain architectures from the homological scaffolds of functional connectivity networks. Frontiers in systems neuroscience, 10:85, 2016.
  19. Network Signature. URL: https://github.com/mmahini/graphlet-analysis.
  20. Rage–a rapid graphlet enumerator for large networks. Computer Networks, 56(2):810–819, 2012.
  21. Strud: Truss decomposition of simplicial complexes. In Proceedings of the Web Conference 2021, pages 3408–3418, 2021.
  22. Fresco: Mining frequent patterns in simplicial complexes. In Proceedings of the ACM Web Conference 2022, pages 1444–1454, 2022.
  23. A survey on subgraph counting: concepts, algorithms, and applications to network motifs and graphlets. ACM Computing Surveys (CSUR), 54(2):1–36, 2021.
  24. Fast approximation of betweenness centrality through sampling. Data Mining and Knowledge Discovery, 30(2):438–475, 2016.
  25. Detecting strong ties using network motifs. In Proceedings of the 26th International Conference on World Wide Web Companion, pages 983–992, 2017.
  26. An overview of microsoft academic service (mas) and applications. In Proceedings of the 24th international conference on world wide web, pages 243–246, 2015.
  27. On the uniform convergence of relative frequencies of events to their probabilities. In Measures of complexity: festschrift for alexey chervonenkis, pages 11–30. Springer, 2015.
  28. Collective dynamics of ‘small-world’networks. nature, 393(6684):440–442, 1998.
  29. Sebastian Wernicke. Efficient detection of network motifs. IEEE/ACM transactions on computational biology and bioinformatics, 3(4):347–359, 2006.
  30. Sam Freddy Ludwien Windels. Graphlet-adjacencies provide complementary views on the functional organisation of the cell and cancer mechanisms. PhD thesis, UCL (University College London), 2022.

Summary

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

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