Search arXivSearch

arXiv · 2308.09677

Strong Topological Trivialization of Multi-Species Spherical Spin Glasses

Abstract

We study the landscapes of multi-species spherical spin glasses. Our results determine the phase boundary for annealed trivialization of the number of critical points, and establish its equivalence with a quenched strong topological trivialization property. Namely in the "trivial" regime, the number of critical points is constant, all are well-conditioned, and all approximate critical points are close to a true critical point. As a consequence, we deduce that Langevin dynamics at sufficiently low temperature has logarithmic mixing time. Our approach begins with the Kac--Rice formula. We characterize the annealed trivialization phase by explicitly solving a suitable multi-dimensional variational problem, obtained by simplifying certain asymptotic determinant formulas from (Ben Arous--Bourgade--McKenna 2023, McKenna 2024). To obtain more precise quenched results, we develop general purpose techniques to avoid sub-exponential correction factors and show non-existence of approximate critical points. Many of the results are new even in the 1-species case.

Explore related subjects

Keep this discovery

BibTeXRIS

Brice Huang, Mark Sellke. 2023-08-18. Strong Topological Trivialization of Multi-Species Spherical Spin Glasses. https://arxiv.org/abs/2308.09677

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR