Statistical physics of loopy interactions: Independent-loop approximation and beyond
نویسندگان
چکیده
We consider an interacting system of spin variables on a loopy interaction graph, identified by a tree graph and a set of loopy interactions. We start from a high-temperature expansion for loopy interactions represented by a sum of non-negative contributions from all the possible frustration-free loop configurations. We then compute the loop corrections using different approximations for the nonlocal loop interactions induced by the spin correlations in the tree graph. For distant loopy interactions, we can exploit the exponential decay of correlations in the tree interaction graph to compute loop corrections within an independent-loop approximation. Higher orders of the approximation are obtained by considering the correlations between the nearby loopy interactions involving larger number of spin variables. In particular, the sum over the loop configurations can be computed "exactly" by the belief propagation algorithm in the low orders of the approximation as long as the loopy interactions have a tree structure. These results might be useful in developing more accurate and convergent message-passing algorithms exploiting the structure of loopy interactions.
منابع مشابه
Computing loop corrections by message passing
Any spanning tree in a loopy interaction graph can be used for communicating the effect of the loopy interactions by introducing messages that are passed along the edges in the spanning tree. This defines an exact mapping of the problem on the loopy interaction graph onto an extended problem on a tree interaction graph, where the thermodynamic quantities can be computed by a message-passing alg...
متن کاملSTATS 375 - Project Proposal
Belief propagation is a message-passing algorithm for performing inference in graphical models that has been implemented in a variety of domains including artificial intelligence, information theory and statistical physics. As we know, BP provides exact results only on a relatively restrictive subclass of problems, when the graphical model is a tree (or more generally if each connected componen...
متن کاملLoop Entropy Assists Tertiary Order: Loopy Stabilization of Stacking Motifs
The free energy of an RNA fold is a combination of favorable base pairing and stacking interactions competing with entropic costs of forming loops. Here we show how loop entropy, surprisingly, can promote tertiary order. A general formula for the free energy of forming multibranch and other RNA loops is derived with a polymer-physics based theory. We also derive a formula for the free energy of...
متن کاملBelief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs
We generalize the belief-propagation algorithm to sparse random networks with arbitrary distributions of motifs (triangles, loops, etc.). Each vertex in these networks belongs to a given set of motifs (generalization of the configuration model). These networks can be treated as sparse uncorrelated hypergraphs in which hyperedges represent motifs. Here a hypergraph is a generalization of a graph...
متن کاملGraph polynomials and approximation of partition functions with Loopy Belief Propagation
The Bethe approximation, or loopy belief propagation algorithm, is a successful method for approximating partition functions of probabilistic models associated with graphs. Chertkov and Chernyak derived an interesting formula called “Loop Series Expansion”, which is an expansion of the partition function. The main term of the series is the Bethe approximation while the other terms are labeled b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 92 3 شماره
صفحات -
تاریخ انتشار 2015