TwinSearch enumerates all twin hypergraphs of a node co-occurrence matrix and shows non-uniqueness is common and structurally diverse for small random hypergraphs.
Scalable Tensor Methods for Nonuniform Hypergraphs
1 Pith paper cite this work, alongside 5 external citations. Polarity classification is still indexing.
1
Pith paper citing it
5
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs
TwinSearch enumerates all twin hypergraphs of a node co-occurrence matrix and shows non-uniqueness is common and structurally diverse for small random hypergraphs.