Emergence in graphs with near-extreme constraints
Emergence in graphs with near-extreme constraints
We consider entropy-optimal graphons associated with extreme and near-extreme constraints on the densities of edges and triangles. We prove that the optimizers for near-extreme constraints are unique and multipodal and are perturbations of the previously known unique optimzers for extreme constraints. This proves the existence of infinitely many phases. We determine the podal structures in these phases and prove the existence of phase transitions between them.
Charles Radin、Lorenzo Sadun
数学
Charles Radin,Lorenzo Sadun.Emergence in graphs with near-extreme constraints[EB/OL].(2025-08-28)[2025-09-06].https://arxiv.org/abs/2411.14556.点此复制
评论