Exact formulas are derived for expected counts of self-loops, multi-hyperedges and degenerate hyperedges in configuration-model hypergraphs, with the expected fraction vanishing asymptotically under mild moment conditions on the degree distribution.
S.Journal of Complex Networks2020,8, cnaa018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Simplicity of random hypergraphs
Exact formulas are derived for expected counts of self-loops, multi-hyperedges and degenerate hyperedges in configuration-model hypergraphs, with the expected fraction vanishing asymptotically under mild moment conditions on the degree distribution.