Ising spin glass models versus Ising models: an effective mapping at high temperature. II: Applications to graphs and networks

DOI10.1088/1742-5468/2006/10/P10005zbMATH Open1456.82473arXivcond-mat/0607518MaRDI QIDQ4968893FDOQ4968893

Authors: Massimo Ostilli 

Publication date: 9 July 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: By applying a recently proposed mapping, we derive exactly the upper phase boundary of several Ising spin glass models defined over static graphs and random graphs, generalizing some known results and providing new ones.

Full work available at URL: https://arxiv.org/abs/cond-mat/0607518

Recommendations

• Ising spin glass models versus Ising models: an effective mapping at high temperature. I: General result
• Ising spin glass models versus Ising models: an effective mapping at high temperature. III: Rigorous formulation and detailed proof for general graphs
• Ising models on power-law random graphs
• Spin-glass behaviour on random lattices
• Spectral bounds for the Ising ferromagnet on an arbitrary given graph

zbMATH Keywords

networksrandom graphsexact resultsdisordered systems (theory)phase diagrams (theory)

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Critical phenomena in equilibrium statistical mechanics (82B27) Percolation (82B43) Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

Cites Work

• Statistical mechanics of complex networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Ising model and percolation on trees and tree-like graphs
• Principles of statistical mechanics of uncorrelated random networks
• Loops of any size and Hamilton cycles in random scale-free networks
• Ising spin glass models versus Ising models: an effective mapping at high temperature. I: General result
• On the number of circuits in random graphs

Cited In (4)

• Ising spin glass models versus Ising models: an effective mapping at high temperature. III: Rigorous formulation and detailed proof for general graphs
• On forest expansions for two-body partition functions on tree-like interaction graphs
• Spin models on random graphs with controlled topologies beyond degree constraints
• Ising spin glass models versus Ising models: an effective mapping at high temperature. I: General result

This page was built for publication: Ising spin glass models versus Ising models: an effective mapping at high temperature. II: Applications to graphs and networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968893)