Analytical evidence for the absence of spin glass transition on self-dual lattices

Masayuki Ohzeki; Hidetoshi Nishimori

doi:10.1088/1751-8113/42/33/332001

Home/Archive/arXiv

arXiv · 0905.3623

Analytical evidence for the absence of spin glass transition on self-dual lattices

Masayuki Ohzeki·Hidetoshi Nishimori

View original source ↗Read source document ↗Export metadata ↓

Abstract

We show strong evidence for the absence of a finite-temperature spin glass transition for the random-bond Ising model on self-dual lattices. The analysis is performed by an application of duality relations, which enables us to derive a precise but approximate location of the multicritical point on the Nishimori line. This method can be systematically improved to presumably give the exact result asymptotically. The duality analysis, in conjunction with the relationship between the multicritical point and the spin glass transition point for the symmetric distribution function of randomness, leads to the conclusion of the absence of a finite-temperature spin glass transition for the case of symmetric distribution. The result is applicable to the random bond Ising model with $\pm J$ or Gaussian distribution and the Potts gauge glass on the square, triangular and hexagonal lattices as well as the random three-body Ising model on the triangular and the Union-Jack lattices and the four dimensional random plaquette gauge model. This conclusion is exact provided that the replica method is valid and the asymptotic limit of the duality analysis yields the exact location of the multicritical point

Explore related subjects

cond-mat.dis-nn cond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Masayuki Ohzeki, Hidetoshi Nishimori. 2009-05-22. Analytical evidence for the absence of spin glass transition on self-dual lattices. https://doi.org/10.1088/1751-8113%2F42%2F33%2F332001

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

KEEP EXPLORING

Related papers

arXiv2026

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn↗

arXiv2026

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn↗

arXiv2026

Extreme-Scale Ising Machines with Cluster Mean-Field Theory

Scaling analog and digital Ising machines to larger problems requires overcoming finite device capacity and the cost of communication between devices. We present cluster mean-field theory (CMFT), a framework that partitions a large interaction graph into clusters sized to fit available hardware. Each cluster performs local updates independently, while interactions across cluster boundaries enter through periodically updated effective biases computed from boundary-spin averages. To reduce the error introduced by fixed cluster boundaries, we introduce dynamic partitioning, which cycles through multiple partitions so that interactions approximated by mean fields at one stage can act through instantaneous spins at another. On three-dimensional spin glasses and planted Pegasus instances, dynamic CMFT exhibits power-law decay of residual energy over sweep budgets. This shows that solution quality continues to improve with computational effort despite the mean-field approximation. An automated graph partitioner combined with a weighted recovery ratio provides a practical heuristic for selecting partition combinations on graphs without natural cut directions. We demonstrate CMFT on four GPUs with approximately four million p-bits, reaching comparable energy densities up to 15 times faster than a single-GPU implementation of the full graph. By coupling locally evolving clusters through programmable effective biases, CMFT provides a route to extreme-scale Ising machines on both analog and digital hardware.

cond-mat.dis-nn↗