A maximum-entropy generalization of the S^1 geometric graph model that enforces arbitrary inter-community edge counts while retaining the standard popularity-similarity form.
Detecting the ultra low dimensionality of real networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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
-
Random Hyperbolic Graphs with Arbitrary Mesoscale Structures
A maximum-entropy generalization of the S^1 geometric graph model that enforces arbitrary inter-community edge counts while retaining the standard popularity-similarity form.