Indexed metadata

A Universal Lower Bound for the Complexity of Gaussian-Divisible Spin Glasses

Pax Kivimae, Benjamin McKenna

Source record

Source: arXiv

Published: Oct 16, 2026

arXiv: 2610.23823

Open original source ↗

Source abstract

We consider a variant of the spherical mixed spin glass model with non-Gaussian disorder. Specifically, we replace the usual standard Gaussian interaction coefficients with Gaussian-divisible ones, meaning that each coefficient can be expressed as the sum of a standard Gaussian random variable and an independent, non-Gaussian random variable. We show that the annealed complexity of this model is at least the annealed complexity of the standard Gaussian model, if the non-Gaussian part is centered and subexponential.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A Universal Lower Bound for the Complexity of Gaussian-Divisible Spin Glasses — Mathematical Frontier Network