Pith. sign in

REVIEW 1 cited by

Emergence in graphs with near-extreme constraints

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.14556 v3 pith:MN4UV43P submitted 2024-11-21 math.PR math-phmath.COmath.MP

Emergence in graphs with near-extreme constraints

classification math.PR math-phmath.COmath.MP
keywords constraintsnear-extremeexistenceextremephasesproveuniqueassociated
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Constrained Multi-Relational Graphons with Maximum Entropy

    math.CO 2026-07 reject novelty 7.0

    The authors claim to resolve the RRS conjecture for multi-relational graphons, but the main theorem silently requires an isolation hypothesis and a keystone topological-stability proof is only sketched.