TwinSearch enumerates all twin hypergraphs of a node co-occurrence matrix and shows non-uniqueness is common and structurally diverse for small random hypergraphs.
An Information-Theoretic, All-Scales Approach to Comparing Networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SI 1years
2025 1verdicts
CONDITIONAL 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.