Emergence in graphs with near-extreme constraints

Abstract

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…