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

Hypergraph Artificial Benchmark for Community Detection (h-ABCD) (2210.15009v3)

Published 26 Oct 2022 in cs.SI, cs.LG, and math.CO

Abstract: The Artificial Benchmark for Community Detection (ABCD) graph is a recently introduced random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar properties as the well-known LFR one, and its main parameter can be tuned to mimic its counterpart in the LFR model, the mixing parameter. In this paper, we introduce hypergraph counterpart of the ABCD model, h-ABCD, which produces random hypergraph with distributions of ground-truth community sizes and degrees following power-law. As in the original ABCD, the new model h-ABCD can produce hypergraphs with various levels of noise. More importantly, the model is flexible and can mimic any desired level of homogeneity of hyperedges that fall into one community. As a result, it can be used as a suitable, synthetic playground for analyzing and tuning hypergraph community detection algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (64)
  1. Emmanuel Abbe. Community detection and stochastic block models: recent developments. The Journal of Machine Learning Research, 18(1):6446–6531, 2017.
  2. Hypergraph spectral clustering in the weighted stochastic block model. IEEE Journal of Selected Topics in Signal Processing, 12(5):959–974, 2018.
  3. Measuring and modeling bipartite graphs with community structure. Journal of Complex Networks, 5(4):581–603, 03 2017. doi:10.1093/comnet/cnx001.
  4. Emergence of scaling in random networks. science, 286(5439):509–512, 1999.
  5. Albert-László Barabási. Network science. Cambridge University Press, 2016. URL: http://barabasi.com/networksciencebook/.
  6. Networks beyond pairwise interactions: structure and dynamics. Physics Reports, 874:1–92, 2020.
  7. The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory, Series A, 24(3):296–307, 1978.
  8. Simplicial closure and higher-order link prediction. Proceedings of the National Academy of Sciences, 115(48):E11221–E11230, 2018.
  9. Higher-order network analysis takes off, fueled by classical ideas and new data. arXiv preprint arXiv:2103.05031, 2021.
  10. Tensor spectral clustering for partitioning higher-order network structures. In Proceedings of the 2015 SIAM International Conference on Data Mining, pages 118–126. SIAM, 2015.
  11. Higher-order organization of complex networks. Science, 353(6295):163–166, 2016.
  12. Julia: A fresh approach to numerical computing. SIAM review, 59(1):65–98, 2017.
  13. 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.
  14. Model-based clustering in simple hypergraphs through a stochastic blockmodel. arXiv preprint arXiv:2210.05983, 2022.
  15. Gunnar Carlsson. Topology and data. Bulletin of the American Mathematical Society, 46(2):255–308, 2009.
  16. Community detection in hypergraphs: Optimal statistical limit and efficient algorithms. In International Conference on Artificial Intelligence and Statistics, pages 871–879. PMLR, 2018.
  17. Nonbacktracking spectral clustering of nonuniform hypergraphs. arXiv preprint arXiv:2204.13586, 2022.
  18. Philip S Chodrow. Configuration models of random hypergraphs. Journal of Complex Networks, 8(3):cnaa018, 2020.
  19. Generative hypergraph clustering: From blockmodels to modularity. Science Advances, 7(28):eabh1303, 2021.
  20. Complex graphs and networks, volume 107 of CBMS Regional Conference Series in Mathematics. American Mathematical Soc., 2006.
  21. Finding community structure in very large networks. Physical review E, 70(6):066111, 2004.
  22. Inference of hyperedges and overlapping communities in hypergraphs. Nature Communications, 13(1):7229, 2022.
  23. Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes. Physical Review E, 93(6):062311, 2016.
  24. Weighted growing simplicial complexes. Physical Review E, 95(6):062301, 2017.
  25. Structural patterns and generative models of real-world hypergraphs. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 176–186, 2020.
  26. Sampling hypergraphs with given degrees. Discrete Mathematics, 344(11):112566, 2021.
  27. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge university press, 2010.
  28. Resolution limit in community detection. Proceedings of the national academy of sciences, 104(1):36–41, 2007.
  29. Random hypergraphs and their applications. Physical Review E, 79(6):066118, 2009.
  30. Consistency of spectral hypergraph partitioning under planted partition model. The Annals of Statistics, 45(1):289–315, 2017.
  31. Preferential attachment hypergraph with high modularity. [Research Report] Université Cote d’Azur, hal-03154836, 2021.
  32. A scalable parallel hypergraph generator (hygen). 8 2020. URL: https://www.osti.gov/biblio/1651312.
  33. Stochastic blockmodels: First steps. Social networks, 5(2):109–137, 1983.
  34. Matthew O Jackson. Social and economic networks. Princeton university press, 2010.
  35. Hypergraph patterns and collaboration structure. arXiv preprint arXiv:2210.02163, 2022.
  36. Modularity of the abcd random graph model with community structure. Journal of Complex Networks, 10(6):cnac050, 2022.
  37. Clustering via hypergraph modularity. PloS one, 14(11):e0224307, 2019.
  38. Community detection algorithm using hypergraph modularity. In International Conference on Complex Networks and Their Applications, pages 152–163. Springer, 2020.
  39. Artificial benchmark for community detection (abcd)—fast random graph model with community structure. Network Science, pages 1–26, 2021.
  40. Mining Complex Networks. CRC Press, 2021.
  41. Outliers in the abcd random graph model with community structure (abcd+o). In Proceedings of the 11th International Conference on Complex Networks and their Applications, 2022 (in press).
  42. Properties and performance of the abcde random graph model with community structure. Big Data Research, 30:100348, 2022. URL: https://www.sciencedirect.com/science/article/pii/S2214579622000429, doi:https://doi.org/10.1016/j.bdr.2022.100348.
  43. Stochastic block model for hypergraphs: Statistical limits and a semidefinite programming approach. arXiv preprint arXiv:1807.02884, 2018.
  44. Hypergraph clustering by iteratively reweighted modularity maximization. Applied Network Science, 5(52), 2020.
  45. A new measure of modularity in hypergraphs: Theoretical insights and implications for effective clustering. In Hocine Cherifi, Sabrina Gaito, José Fernendo Mendes, Esteban Moro, and Luis Mateus Rocha, editors, Complex Networks and Their Applications VIII, pages 286–297, Cham, 2020. Springer International Publishing.
  46. Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80(1):016118, 2009.
  47. Limits of modularity maximization in community detection. Physical review E, 84(6):066122, 2011.
  48. Benchmark graphs for testing community detection algorithms. Physical review E, 78(4):046110, 2008.
  49. Efficiently inferring community structure in bipartite networks. Phys. Rev. E, 90:012805, Jul 2014. doi:10.1103/PhysRevE.90.012805.
  50. How do hyperedges overlap in real-world hypergraphs?-patterns, measures, and generators. In Proceedings of the Web Conference 2021, pages 3396–3407, 2021.
  51. Mark Newman. Networks. Oxford university press, 2018.
  52. Mark EJ Newman. Fast algorithm for detecting community structure in networks. Physical review E, 69(6):066133, 2004.
  53. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.
  54. A comparison of community detection algorithms on artificial networks. In Discovery Science: 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009 12, pages 242–256. Springer, 2009.
  55. Core-periphery models for hypergraphs. KDD ’22, page 1337–1347. Association for Computing Machinery, 2022. doi:10.1145/3534678.3539272.
  56. Adapting stochastic block models to power-law degree distributions. IEEE transactions on cybernetics, 49(2):626–637, 2018.
  57. A principled, flexible and efficient framework for hypergraph benchmarking. arXiv preprint arXiv:2212.08593, 2022.
  58. Entropy-based random models for hypergraphs, 2022. doi:10.48550/ARXIV.2207.12123.
  59. Core-periphery detection in hypergraphs. SIAM Journal on Mathematics of Data Science, 5(1):1–21, 2023.
  60. Nicholas C Wormald. Generating random regular graphs. Journal of algorithms, 5(2):247–280, 1984.
  61. Nicholas C Wormald et al. Models of random regular graphs. London Mathematical Society Lecture Note Series, pages 239–298, 1999.
  62. Higher-order clustering in networks. Physical Review E, 97(5):052306, 2018.
  63. Local higher-order graph clustering. In Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pages 555–564, 2017.
  64. Learning with hypergraphs: Clustering, classification, and embedding. Advances in neural information processing systems, 19, 2006.
Citations (13)
View on Semantic Scholar

Summary

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

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