English
Related papers

Related papers: The antiferromagnetic Ising model beyond line grap…

200 papers

We examine Ising models with heat-bath dynamics on directed networks. Our simulations show that Ising models on directed triangular and simple cubic lattices undergo a phase transition that most likely belongs to the Ising universality…

Statistical Mechanics · Physics 2015-12-02 Adam Lipowski , Antonio Luis Ferreira , Dorota Lipowska , Krzysztof Gontarek

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…

Machine Learning · Statistics 2015-02-04 Jason K. Johnson , Diane Oyen , Michael Chertkov , Praneeth Netrapalli

The generalized mapping transformation technique is used to obtain the exact solution for the transverse Ising model on decorated planar lattices. Within this scheme, the basic thermodynamic quantities are calculated for different planar…

Statistical Mechanics · Physics 2009-11-07 Jozef Strecka , Michal Jascur

We consider the ferromagnetic Ising model on a sequence of graphs $G_n$ converging locally weakly to a rooted random tree. Generalizing [Montanari, Mossel, Sly '11], under an appropriate "continuity" property, we show that the Ising…

Probability · Mathematics 2015-10-30 Anirban Basak , Amir Dembo

We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+\alpha$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an…

Statistical Mechanics · Physics 2015-05-13 Takehisa Hasegawa , Koji Nemoto

Consider the event that there is a $+$ crossing from left to right in a box for the Ising model on the triangular lattice. We show that this event is noise sensitive under Glauber dynamics $t \mapsto \sigma_t$ in the subcritical regime…

Probability · Mathematics 2025-08-07 Vincent Tassion , Hugo Vanneuville

Synthetic antiferromagnets with strong perpendicular anisotropy can be modeled by layered Ising antiferromagnets. Accounting for the fact that in the experimental systems the ferromagnetic layers, coupled antiferromagnetically via spacers,…

Statistical Mechanics · Physics 2014-07-30 James Mayberry , Keith Tauscher , Michel Pleimling

The $q$-neighbor Ising model is investigated on homogeneous random graphs with a fraction of edges associated randomly with antiferromagnetic exchange integrals and the remaining edges with ferromagnetic ones. It is a nonequilibrium model…

Statistical Mechanics · Physics 2020-12-09 A. Krawiecki

A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…

Discrete Mathematics · Computer Science 2020-12-14 Franz J. Brandenburg

Glauber dynamics of a bond-diluted Ising model on a Bethe lattice (a random graph with fixed connectivity) is investigated by an approximate theory which provides exact results for equilibrium properties. The time-dependent solutions of the…

Statistical Mechanics · Physics 2015-05-18 Hiroki Ohta

This paper studies structure detection problems in high temperature ferromagnetic (positive interaction only) Ising models. The goal is to distinguish whether the underlying graph is empty, i.e., the model consists of independent Rademacher…

Statistics Theory · Mathematics 2021-01-13 Yuan Cao , Matey Neykov , Han Liu

We study constrained percolation models on planar lattices including the $[m,4,n,4]$ lattice and the square tilings of the hyperbolic plane, satisfying certain local constraints on faces of degree 4, and investigate the existence of…

Probability · Mathematics 2020-01-30 Zhongyang Li

Three dimensional Ising model ferromagnets on different lattices with nearest neighbor interactions, and on simple cubic lattices with equivalent interactions out to further neighbors, are studied numerically. The susceptibility data for…

Statistical Mechanics · Physics 2011-07-28 P. H. Lundow , I. A. Campbell

We describe a method, based on "hard" contact topology, of showing the existence of semi-infinite trajectories of contact Hamiltonian flows which start on one Legendrian submanifold and asymptotically converge to another Legendrian…

Mathematical Physics · Physics 2023-05-09 Michael Entov , Leonid Polterovich

The Ising antiferromagnet is an important statistical physics model with close connections to the {\sc Max Cut} problem. Combining spatial mixing arguments with the method of moments and the interpolation method, we pinpoint the replica…

Combinatorics · Mathematics 2020-11-13 Amin Coja-Oghlan , Philipp Loick , Balázs F. Mezei , Gregory B. Sorkin

We consider an Ising model on a square grid with ferromagnetic spin-spin interactions spanning beyond nearest neighbors. Starting from initial states with a single unbounded interface separating ordered phases, we investigate the evolution…

Statistical Mechanics · Physics 2013-06-25 P. L. Krapivsky , Jason Olejarz

Strongly correlated metals often display anomalous transport, including $T$-linear resistivity above the Mott-Ioffe-Regel limit. We introduce a tractable microscopic model for such bad metals, by supplementing the well-known Hubbard model…

Strongly Correlated Electrons · Physics 2019-05-15 Connie H. Mousatov , Ilya Esterlis , Sean A. Hartnoll

The current status of experiments on the d=2 and d=3 random-exchange and random-field Ising models, as realized in dilute anisotropic antiferromagnets, is discussed. Two areas of current investigation are emphasized. For d=3, the large…

Disordered Systems and Neural Networks · Physics 2007-05-23 D. P. Belanger

Consider random $d$-regular graphs, i.e., random graphs such that there are exactly $d$ edges from each vertex for some $d\ge 3$. We study both the configuration model version of this graph, which has occasional multi-edges and self-loops,…

Probability · Mathematics 2021-04-27 Van Hao Can , Remco van der Hofstad , Takashi Kumagai

In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. We first observe that the notoriously difficult problem of learning parities…

Machine Learning · Statistics 2014-12-04 Guy Bresler , David Gamarnik , Devavrat Shah