Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.12728

Toward mean-field bound for critical temperature on Nishimori line

Manaka Okuyama·Masayuki Ohzeki
View original source ↗Read source document ↗Export metadata ↓

Abstract

The critical inverse temperature of the mean-field approximation establishes a lower bound of the true critical inverse temperature in a broad class of ferromagnetic spin models. This is referred to as the mean-field bound for the critical temperature. In this study, we explored the possibility of a corresponding mean-field bound for the critical temperature in Ising spin glass models with Gaussian randomness on the Nishimori line. On this line, the critical inverse temperature of the mean-field approximation is given by $β_{MF}^{NL}=\sqrt{1/z}$, where $z$ is the coordination number. Using the Griffiths inequalities on the Nishimori line, we proved that there is zero spontaneous magnetization in the high-temperature region $β< β_{MF}^{NL}/2$. In other words, the true critical inverse temperature $β_c^{NL}$ on the Nishimori line is always bounded by $β_c^{NL} \ge β_{MF}^{NL}/2$. Unfortunately, we have not succeeded in obtaining the corresponding mean-field bound $β_c^{NL} \ge β_{MF}^{NL}$ on the Nishimori line.

Explore related subjects

cond-mat.dis-nncond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manaka Okuyama, Masayuki Ohzeki. 2024-09-24. Toward mean-field bound for critical temperature on Nishimori line. https://doi.org/10.7566/jpsj.93.104706

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

KEEP EXPLORING

Related papers

arXiv2026

On the robustness of noisy solutions in non-convex neural networks

Optimization in non-convex neural network models is strongly influenced by the geometry of the solution space: sparse, isolated, point-like clusters are typically algorithmically inaccessible, whereas wide and flat regions can be found efficiently despite being relatively rare. At zero temperature this picture has been formalized in binary perceptrons through the overlap gap property (OGP), which limits algorithmic access to configurations with zero training error above a critical constraint density $α_{\rm OGP}$. Here we extend this description to finite temperature, where a positive training error is allowed and statistically penalized. We first show that the frozen one-step replica-symmetry-breaking solution, dominating the zero temperature equilibrium measure, survives at any finite temperature. We furthermore derive a general criterion, based on the smoothness of the single-pattern Gibbs weight near the decision boundary, that determines when a finite-temperature relaxation of the loss removes freezing. We then extend the OGP construction to finite temperature and show that dense, algorithmically accessible regions of finite-energy configurations persist beyond $α_{\rm OGP}$, up to a threshold $α_{\rm OGP}(ε)$ that grows with the allowed training error $ε$. Finally, in the teacher-student setting, we show that these wide, finite-energy regions still retain good generalization. Using a finite energy message-passing algorithm, we demonstrate numerically that thermal noise enables effective generalization in the regime of constraint densities where both recovering the teacher and finding a zero temperature solution are computationally hard.

cond-mat.dis-nn↗
arXiv2026

Transition path sampling in Ising models on heterogeneous graphs

Activated transitions have rates that are often exponentially small in system size. Extracting the associated activation barriers is challenging in practice, especially in the deeply metastable regimes and in the presence of disorder. Here, we use transition path sampling to evaluate transition probabilities between ferromagnetic states in the Ising model on finite sparse random graphs, which are perhaps the simplest example of a disordered system with metastable states. To interpret the transient onset of the transition probability curve, we introduce a minimal three-state kinetic description that highlights the role of intermediate configurations. We validate the method on the heterogeneous Zachary Karate Club network, where distinct dynamical regimes emerge as temperature varies. We then apply the method to random regular graphs and Erdős-Rényi graphs, showing that sample-to-sample fluctuations are weak in the former but that quenched topological disorder induces sizable instance variability in the latter. For Erdős-Rényi graphs, we introduce an instance-dependent temperature rescaling that restores a consistent finite-size scaling of dynamical rates and enables a direct comparison with the corresponding static free-energy barrier.

cond-mat.dis-nn↗
arXiv2026

Estimates of ground state energies for the quantum SK and 2D-EA models, using deGennes-Suzuki-Kubo mean-field annealing dynamics

We perform large scale quantum annealing of the Sherrington-Kirkpatrick (SK) spin glass up to a system size $N=40000$ to estimate its ground state energy using the deGennes-Suzuki-Kubo mean-field quantum Ising dynamics, extending the earlier results (reported in Eur. Phys. J. B {\bf 98}, 226 (2025)). Here we numerically solve the deGennes-Suzuki-Kubo annealing dynamics to obtain the spin configurations and subsequently the ground state energy for a given system size at the end of the annealing, starting from a quantum paramagnetic state. The method shows high efficiency, with an overall algorithmic cost of $O(N^3)$ in estimating the energy of the ground state. We later extend this quantum annealing study to estimate the ground state energies (starting again from the quantum paramagnetic phase, annealing down to any desired low value of the transverse field) for the Edwards-Anderson (EA) spin glass model on a square lattice.

cond-mat.dis-nn↗