Browsed by
Tag: Kikuchi

The 1-D Cluster Variation Method (CVM) – Simple Application

The 1-D Cluster Variation Method (CVM) – Simple Application

The 1-D Cluster Variation Method – Application to Text Mining and Data Mining There are three particularly good reasons for us to look at the Cluster Variation Method (CVM) as an alternative means of understanding the information in a system: The CVM captures local pattern distributions (for an equilibrium state), When the system is made up of equal numbers of units in each of two states, and the enthalpy for each state is the same (the simple unit activation energy…

Read More Read More

Analytic Single-Point Solution for Cluster Variation Method Variables (at x1=x2=0.5)

Analytic Single-Point Solution for Cluster Variation Method Variables (at x1=x2=0.5)

Single-Point Analytic Cluster Variation Method Solution: Solving Set of Three Nonlinear, Coupled Equations The Cluster Variation Method, first introduced by Kikuchi in 1951 (“A theory of cooperative phenomena,” Phys. Rev. 81 (6), 988-1003), provides a means for computing the free energy of a system where the entropy term takes into account distributions of particles into local configurations as well as the distribution into “on/off” binary states. As the equations are more complex, numerical solutions for the cluster variation variables are…

Read More Read More

Gibbs Free Energy, Belief Propagation, and Markov Random Fields

Gibbs Free Energy, Belief Propagation, and Markov Random Fields

Correspondence Between Free Energy, Belief Propagation, and Markov Random Field Models As a slight digression from previous posts – re-reading the paper by Yedidia et al. on this morning on Understanding Belief Propagation and its Generalizations – which explains the close connection between Belief Propagation (BP) methods and the Bethe approximation (a more generalized version of the simple bistate Ising model that I’ve been using) in statistical thermodynamics. The important point that Yedidia et al. make is that their work…

Read More Read More

Community Detection in Graphs

Community Detection in Graphs

Complexity and Graph Theory: A Brief Note Santo Fortunato has published an interesting and densly rich article, Community Detection in Graphs, in  Complexity (Inter-Wiley). This article is over 100 pages long, it is relatively complete, with numerous references and excellent figures. It is a bit surprising, however, that this extensive discussion misses one of the things that would seem to be most important in discussing graphs, and particularly, clusters within graphs: the stability of these clusters. That is; the theoretical basis for cluster…

Read More Read More