Mappings for Marginal Probabilities with Applications to Models in Statistical Physics

by   Mehdi Molkaraie, et al.

We present local mappings that relate the marginal probabilities of a global probability mass function represented by its primal normal factor graph to the corresponding marginal probabilities in its dual normal factor graph. The mapping is based on the Fourier transform of the local factors of the models. Details of the mapping are provided for the Ising model, where it is proved that the local extrema of the fixed points are attained at the phase transition of the two-dimensional nearest-neighbor Ising model. The results are further extended to the Potts model, to the clock model, and to Gaussian Markov random fields. By employing the mapping, we can transform simultaneously all the estimated marginal probabilities from the dual domain to the primal domain (and vice versa), which is advantageous if estimating the marginals can be carried out more efficiently in the dual domain. An example of particular significance is the ferromagnetic Ising model in a positive external magnetic field. For this model, there exists a rapidly mixing Markov chain (called the subgraphs–world process) to generate configurations in the dual normal factor graph of the model. Our numerical experiments illustrate that the proposed procedure can provide more accurate estimates of marginal probabilities of a global probability mass function in various settings.


page 1

page 2

page 3

page 4


Marginal Densities, Factor Graph Duality, and High-Temperature Series Expansions

We prove that the marginals densities of a primal normal factor graph an...

Efficient Sampling for Selecting Important Nodes in Random Network

We consider the problem of selecting important nodes in a random network...

Finding Many Sparse Cuts Using Entropy Maximization

A randomized algorithm for finding sparse cuts is given which is based o...

Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue

Mehta and Panigrahi (FOCS 2012) introduce the problem of online matching...

Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study

This paper proposes a method for construction of approximate feasible pr...

On a flexible construction of a negative binomial model

This work presents a construction of stationary Markov models with negat...

Rapid Mixing of k-Class Biased Permutations

In this paper, we study a biased version of the nearest-neighbor transpo...

Please sign up or login with your details

Forgot password? Click here to reset