Related papers: Stratified Sampling for the Ising Model: A Graph-T…
We analyze income tax evasion dynamics in a standard model of statistical mechanics, the Ising model of ferromagnetism. However, in contrast to previous research, we use an inhomogeneous multi-dimensional Ising model where the local degrees…
Monte-Carlo techniques are standard numerical tools for exploring non-Gaussian and multivariate likelihoods. Many variants of the original Metropolis-Hastings algorithm have been proposed to increase the sampling efficiency. Motivated by…
We calculate the critical temperature of the Ising model on a set of graphs representing a concatenated three-bit error-correction code. The graphs are derived from the stabilizer formalism used in quantum error correction. The stabilizer…
We study the fixed-magnetization ferromagnetic Ising model on random $d$-regular graphs for $d\ge 3$ and inverse temperature below the tree reconstruction threshold. Our main result is that for each magnetization $\eta$, the free energy…
We propose a method for modeling the magnetic properties of nanomaterials with different structures. The method is based on the Ising model and the approximation of the random field interaction. It is shown that in this approximation, the…
The basic problem in equilibrium statistical mechanics is to compute phase space average, in which Monte Carlo method plays a very important role. We begin with a review of nonlocal algorithms for Markov chain Monte Carlo simulation in…
The Ising model is of prime importance in the field of statistical mechanics. Here we show that Ising-type interactions can be realized in periodically-driven circuits of stochastic binary resistors with memory. A key feature of our…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
The Ising model in small-world networks generated from two- and three-dimensional regular lattices has been studied. Monte Carlo simulations were carried out to characterize the ferromagnetic transition appearing in these systems. In the…
Given a graph $G$, we form a random subgraph $G_p$ by including each edge of $G$ independently with probability $p$. We provide an asymptotic expansion of the expected number of independent sets in random subgraphs of regular bipartite…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We show that a large collection of statistical mechanical systems with quadratically represented Hamiltonians on the complete graph can be extended to infinite exchangeable processes. This extends a known result for the ferromagnetic…
We propose a simple approach for studying systems of compressed matter based on the Thomas-Fermi statistical model of single atom. The central point of our work is the development of the concept of ``statistical ionization'' by compression;…
Employing heuristic susceptibility equations in conjunction with the well-known critical exponents, the magnetization and partition function for two-dimensional nearest neighbour Ising models are formulated in terms of the Gauss…
The data-driven characterization of the ``complexity'' present in dynamical systems remains an open problem with broad applications across the physical sciences. We investigate the ``structural complexity'' of the 2D ferromagnetic Ising…
We analyse the steady state regime of a one dimensional Ising model under a tapping dynamics recently introduced by analogy with the dynamics of mechanically perturbed granular media. The idea that the steady state regime may be described…
The class of two-spin systems contains several important models, including random independent sets and the Ising model of statistical physics. We show that for both the hard-core (independent set) model and the anti-ferromagnetic Ising…
Here is proposed a general subgraph-based method for efficiently sampling certain graphical models, typically using subgraphs of a fixed treewidth, and also a related method for finding minimum energy (ground) states. In the case of models…
We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…
We present an efficient sampling method for computing a partition function and accelerating configuration sampling. The method performs a random walk in the $\lambda$ space, with $\lambda$ being any thermodynamic variable that characterizes…