Near the boundary of feasible edge and triangle densities, entropy-optimal graphons are unique, multipodal, and analytic in the constraints, yielding infinitely many phases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Emergence in graphs with near-extreme constraints
Near the boundary of feasible edge and triangle densities, entropy-optimal graphons are unique, multipodal, and analytic in the constraints, yielding infinitely many phases.