Pith. sign in

REVIEW

Universality of Ghirlanda-Guerra identities and spin distributions in mixed p-spin models

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 1612.09250 v3 pith:OQSZPG7K submitted 2016-12-29 math.PR

Universality of Ghirlanda-Guerra identities and spin distributions in mixed p-spin models

classification math.PR
keywords spinuniversalitydistributionsmixedmodelsidentitiesmomentsunder
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We prove universality of the Ghirlanda-Guerra identities and spin distributions in the mixed $p$-spin models. The assumption for the universality of the identities requires exactly that the coupling constants have zero means and finite variances, and the result applies to the Sherrington-Kirkpatrick model. As an application, we obtain weakly convergent universality of spin distributions in the generic $p$-spin models under the condition of two matching moments. In particular, certain identities for 3-overlaps and 4-overlaps under the Gaussian disorder follow. Under the stronger mode of total variation convergence, we find that universality of spin distributions in the mixed $p$-spin models holds if mild dilution of connectivity by the Viana-Bray diluted spin glass Hamiltonians is present and the first three moments of coupling constants in the mixed $p$-spin Hamiltonians match. These universality results are in stark contrast to the characterization of spin distributions in the undiluted mixed $p$-spin models, which is known up to now that four matching moments are required in general.

discussion (0)

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