Spectral bounds for the Ising ferromagnet on an arbitrary given graph

DOI10.1088/1742-5468/aa6f1ezbMath1457.82445arXiv1609.08269OpenAlexW2526329931WikidataQ59460025 ScholiaQ59460025MaRDI QIDQ3303065

Lenka Zdeborová, Florent Krzakala, Alaa Saade

Publication date: 11 August 2020

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

Full work available at URL: https://arxiv.org/abs/1609.08269

Mathematics Subject Classification ID

Statistical mechanics of magnetic materials (82D40)

Related Items (1)

Unnamed Item

Uses Software

• Ace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational implications of reducing data to sufficient statistics
• Ising models on locally tree-like graphs
• GPU accelerated Monte Carlo simulation of the 2D and 3D Ising model
• Ising critical exponents on random trees and graphs
• Loop series for discrete statistical models on graphs
• Efficiently Learning Ising Models on Arbitrary Graphs
• Spectral redemption in clustering sparse networks
• Polynomial-Time Approximation Algorithms for the Ising Model
• A New Class of Upper Bounds on the Log Partition Function
• Graphical Models, Exponential Families, and Variational Inference
• Information, Physics, and Computation
• A Combinatorial Solution of the Two-Dimensional Ising Model

This page was built for publication: Spectral bounds for the Ising ferromagnet on an arbitrary given graph