Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A framework to generate hypergraphs with community structure (2212.08593v2)

Published 16 Dec 2022 in cs.SI and physics.soc-ph

Abstract: In recent years hypergraphs have emerged as a powerful tool to study systems with multi-body interactions which cannot be trivially reduced to pairs. While highly structured methods to generate synthetic data have proved fundamental for the standardized evaluation of algorithms and the statistical study of real-world networked data, these are scarcely available in the context of hypergraphs. Here we propose a flexible and efficient framework for the generation of hypergraphs with many nodes and large hyperedges, which allows specifying general community structures and tune different local statistics. We illustrate how to use our model to sample synthetic data with desired features (assortative or disassortative communities, mixed or hard community assignments, etc.), analyze community detection algorithms, and generate hypergraphs structurally similar to real-world data. Overcoming previous limitations on the generation of synthetic hypergraphs, our work constitutes a substantial advancement in the statistical modeling of higher-order systems.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (85)
  1. Physics Reports 424, 175–308 (2006).
  2. nature 393, 440–442 (1998).
  3. Physical review letters 87, 198701 (2001).
  4. science 286, 509–512 (1999).
  5. S. Fortunato, Community detection in graphs. Physics reports 486, 75–174 (2010).
  6. Physical review E 69, 026113 (2004).
  7. Physical review E 78, 046110 (2008).
  8. Physics reports 659, 1–44 (2016).
  9. Physical review letters 96, 114102 (2006).
  10. Physical review letters 113, 088701 (2014).
  11. PloS one 17, e0263184 (2022).
  12. Frontiers in neuroscience 11, 441 (2017).
  13. Biological Reviews 96, 2716–2734 (2021).
  14. Physics Reports 874, 1–92 (2020).
  15. SIAM Review 63, 435-485 (2021).
  16. Nature Physics 17, 1093–1098 (2021).
  17. Journal of The Royal Society Interface 11, 20140873 (2014).
  18. Journal of Computational Neuroscience 41, 1–14 (2016).
  19. Nature Physics pp. 1–9 (2023).
  20. EPJ Data Science 6, 1–16 (2017).
  21. Nature 548, 210–213 (2017).
  22. PLOS Computational Biology 5, e1000385 (2009).
  23. Proceedings of the National Academy of Sciences 113, 10442–10447 (2016).
  24. Scientific Reports 11, 1–10 (2021).
  25. bioRxiv (2022).
  26. Chaos: An Interdisciplinary Journal of Nonlinear Science 26, 094814 (2016).
  27. Communications Physics 3, 1–6 (2020).
  28. Physical Review Letters 124, 218301 (2020).
  29. Physical Review Research 2, 033410 (2020).
  30. Nature Communications 12, 1–13 (2021).
  31. Nature Communications 10, 1–9 (2019).
  32. Journal of Physics: Complexity 2, 035019 (2021).
  33. Physical Review E 101, 032310 (2020).
  34. SIAM Review 62, 353–391 (2020).
  35. Physical Review E 101, 022308 (2020).
  36. Nature Human Behaviour 5, 586–595 (2021).
  37. Physical Review Letters 127, 268301 (2021).
  38. A. R. Benson, Three hypergraph eigenvector centralities. SIAM Journal on Mathematics of Data Science 1, 293–312 (2019).
  39. Communications Physics 4, 1–10 (2021).
  40. Proceedings of the National Academy of Sciences 115, E11221–E11230 (2018).
  41. Communications Physics 5, 79 (2022).
  42. Communications Physics 4, 1–9 (2021).
  43. Nature Communications 13, 7229 (2022).
  44. Communications Physics 4, 1–11 (2021).
  45. Journal of Physics: Complexity 2, 015011 (2021).
  46. Communications Physics 4, 1–12 (2021).
  47. Science Advances 7, eabh1303 (2021).
  48. Physical Review E 93, 062311 (2016).
  49. Physical Review E 96, 032312 (2017).
  50. P. S. Chodrow, Configuration models of random hypergraphs. Journal of Complex Networks 8, cnaa018 (2020).
  51. M. Barthelemy, Class of models for random hypergraphs. Phys. Rev. E 106, 064310 (2022).
  52. Physical Review E 104, 054302 (2021).
  53. P. Krapivsky, Random recursive hypergraphs. Journal of Physics A: Mathematical and Theoretical 56, 195001 (2023).
  54. arXiv preprint arXiv:1912.07403 (2019).
  55. Social networks 29, 173–191 (2007).
  56. Physical Review E 70, 066117 (2004).
  57. arXiv preprint arXiv:2101.05135 (2021).
  58. Physical Review E 95, 042317 (2017).
  59. SIAM review 51, 455–500 (2009).
  60. Nature 401, 788–791 (1999).
  61. Physical review E 83, 016107 (2011).
  62. arXiv preprint arXiv:2301.11226 (2023).
  63. S. L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph. i. Journal of the Society for Industrial and Applied Mathematics 10, 496–506 (1962).
  64. S. A. Choudum, A simple proof of the erdos-gallai theorem on graph sequences. Bulletin of the Australian Mathematical Society 33, 67–70 (1986).
  65. W. K. Hastings, Monte carlo sampling methods using markov chains and their applications (1970).
  66. arXiv preprint arXiv:1606.00730 (2016).
  67. SIAM Journal on Mathematics of Data Science 5, 251–279 (2023).
  68. Advances in neural information processing systems 19 (2006).
  69. J. H. Fowler, Connecting the congress: A study of cosponsorship networks. Political Analysis 14, 456–487 (2006).
  70. J. H. Fowler, Legislative cosponsorship networks in the US house and senate. Social networks 28, 454–465 (2006).
  71. Physica A: Statistical Mechanics and its Applications 364, 581–594 (2006).
  72. arXiv preprint arXiv:2203.03060 (2022).
  73. Physical Review E 106, 034319 (2022).
  74. P. Bonacich, Factoring and weighting approaches to status scores and clique identification. Journal of mathematical sociology 2, 113–120 (1972).
  75. A. Bretto, Hypergraph theory. An introduction. Mathematical Engineering. Cham: Springer (2013).
  76. arXiv preprint physics/0505137 (2005).
  77. PloS one 10, e0136497 (2015).
  78. Journal of the american statistical association 103, 248–258 (2008).
  79. Scientific reports 10, 1–16 (2020).
  80. Nature communications 7, 1–11 (2016).
  81. The European Physical Journal B 90, 1–14 (2017).
  82. Journal of Physics: Complexity 3, 015010 (2022).
  83. Journal of Complex Networks 11, cnad019 (2023).
  84. Random Structures & Algorithms 59, 407–463 (2021).
  85. https://github.com/PhilChodrow/hypergraph.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Nicolò Ruggeri (9 papers)
  2. Federico Battiston (66 papers)
  3. Caterina De Bacco (51 papers)
Citations (7)
View on Semantic Scholar

Summary

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

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

GitHub

  1. GitHub - nickruggeri/Hy-MMSBM: Inference and sampling on the Hy-MMSBM probabilistic model for hypergraphs. (17 stars)