Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · cond-mat/0104264

State Hierarchy Induced by Correlated Spin Domains in short range spin glasses

Eytan Domany·Guy Hed·Matteo Palassini·A. P. Young
View original source ↗Read source document ↗Export metadata ↓

Abstract

We generate equilibrium configurations for the three and four dimensional Ising spin glass with Gaussian distributed couplings at temperatures well below the transition temperature T_c. These states are analyzed by a recently proposed method using clustering. The analysis reveals a hierarchical state space structure. At each level of the hierarchy states are labeled by the orientations of a set of correlated macroscopic spin domains. Our picture of the low temperature phase of short range spin glasses is that of a State Hierarchy Induced by Correlated Spin domains (SHICS). The complexity of the low temperature phase is manifest in the fact that the composition of such a spin domain (i.e. its constituent spins), as well as its identifying label, are defined and determined by the ``location'' in the state hierarchy at which it appears. Mapping out the phase space structure by means of the orientations assumed by these domains enhances our ability to investigate the overlap distribution, which we find to be non-trivial. Evidence is also presented that these states may have a non-ultrametric structure.

Explore related subjects

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

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eytan Domany, Guy Hed, Matteo Palassini, A. P. Young. 2001-08-03. State Hierarchy Induced by Correlated Spin Domains in short range spin glasses. https://doi.org/10.1103/physrevb.64.224406

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

KEEP EXPLORING

Related papers

arXiv2026

Embedding stochastic dynamics in latent manifolds of recurrent neural networks

Recurrent neural networks (RNNs) provide a theoretical framework for understanding computation in biological neural circuits through their ability to support rich time-dependent behaviour. Whilst high-dimensional by construction, they can be used to encode low-dimensional dynamical systems, for example by restricting to low-rank connectivity, hence mirroring the emergence of latent neural manifolds found in empirical neural data. Here, we exploit a relationship between RNNs and a class of universal approximators to train networks that can represent arbitrary, nonlinear stochastic differential equations (SDEs), with given drift and diffusion coefficients, within a low-dimensional latent subspace. We show that RNNs can faithfully embed the drift and diffusion of a given SDE, including nonlinear and nonequilibrium dynamics such as chaotic attractors. We apply this approach by constructing RNN realisations of stochastic systems that transiently explore various attractors through both input-driven switching and autonomous transitions driven by nonequilibrium currents, which we interpret as models of associative and sequential (episodic) memory. To elucidate how these dynamics are encoded in the network, we introduce decompositions of the RNN based on its asymmetric connectivity and its time-irreversibility. Our results show that neural populations can implement a broad class of stochastic dynamics within low-dimensional manifolds, unifying ideas from the dynamics of neural computation, the theory of neural manifolds, associative memory, and nonequilibrium statistical mechanics.

cond-mat.dis-nn↗
arXiv2026

Deep-layered machines have a built-in Occam's razor

Many complex systems map vast numbers of microscopic descriptions onto far fewer macroscopic outcomes. Surprisingly, these input-output maps strongly favor simple outputs. In an exactly solvable deep-layered machine, we prove that simplicity bias strengthens with every layer. The probability of an output function $F$ approaches $\Pr(F)\propto 2^{-K(F)}$, where $K$ is the Kolmogorov complexity. Our results show that hierarchical composition alone can generate an intrinsic Occam's razor, suggesting a general mechanism for simplicity bias in learning and evolution.

cond-mat.dis-nn↗
arXiv2026

Cup and Cap Topological Neural Network

Topological Deep Learning (TDL) is designed to learn features associated not only with nodes but also with edges, triangles and higher dimensional simplices. However, most TDL approaches, being based on boundary operators and Hodge Laplacians, have the limitation that features and signals cannot be lifted or lowered across more than one dimension per layer. To overcome this limitation, in this work, we propose the adoption of the cup and cap products. Specifically, we formulate the Cup and Cap Topological Neural Network (CCNN), a topological deep learning architecture designed to learn node-based variables (or 0-cochains) by taking into account their many-body interactions (e.g. triangles) present in the data. We validate CCNN by assessing its performance on the TopoBench datasets, demonstrating its competitive performance with respect to other simplicial complex neural networks.

cond-mat.dis-nn↗