Abstract

Markov random field models are powerful tools for the study of complex systems. However, little is known about how the interactions between the elements of such systems are encoded, especially from an information-theoretic perspective. In this paper, our goal is to enlighten the connection between Fisher information, Shannon entropy, information geometry and the behavior of complex systems modeled by isotropic pairwise Gaussian Markov random fields. We propose analytical expressions to compute local and global versions of these measures using Besag’s pseudo-likelihood function, characterizing the system’s behavior through its Fisher curve , a parametric trajectory across the information space that provides a geometric representation for the study of complex systems in which temperature deviates from infinity. Computational experiments show how the proposed tools can be useful in extracting relevant information from complex patterns. The obtained results quantify and support our main conclusion, which is: in terms of information, moving towards higher entropy states (A –> B) is different from moving towards lower entropy states (B –> A), since the Fisher curves are not the same, given a natural orientation (the direction of time).

Highlights

  • With the increasing value of information in modern society and the massive volume of digital data that is available, there is an urgent need for developing novel methodologies for data filtering and analysis in complex systems

  • The remarkable Hammersley–Clifford theorem [26] states the equivalence between Gibbs random fields (GRF) and Markov random fields (MRF), which implies that any MRF can be defined either in terms of a global or a local model

  • In order to avoid the use of approximations in the computation of the global Fisher information in an isotropic pairwise Gaussian Markov random field (GMRF), we provide an exact expression for φβ and ψβ as Type I and

Read more

Summary

Introduction

With the increasing value of information in modern society and the massive volume of digital data that is available, there is an urgent need for developing novel methodologies for data filtering and analysis in complex systems. Patterns that at first may appear to be locally irrelevant may turn out to be extremely informative in a more global perspective In complex systems, this is a direct consequence of the intricate non-linear relationship between the pieces of data along different locations and scales. The advantage of MRF models over the traditional statistical ones is that MRFs take into account the dependence between pieces of information as a function of the system’s temperature, which may even be variable along time Speaking, this investigation aims to explore ways to measure and quantify distances between complex systems operating in different thermodynamical conditions. The remainder of the paper is organized as follows: Section 2 discusses a technique for the estimation of the inverse temperature parameter, called the maximum pseudo-likelihood (MPL) approach, and provides derivations for the observed Fisher information in an isotropic pairwise GMRF model.

Fisher Information in Isotropic Pairwise GMRFs
Maximum Pseudo-Likelihood Estimation
Fisher Information of Spatial Dependence Parameters
The Information Equality
Observed Fisher Information
The Role of Fisher Information in GMRF Models
Expected Fisher Information
The Type I Expected Fisher Information
The Type II Expected Fisher Information
Information Equilibrium in GMRF Models
Entropy in Isotropic Pairwise GMRFs
Asymptotic Variance of MPL Estimators
The Asymptotic Variance of the Inverse Temperature Parameter
The Fisher Curve of a System
Computational Simulations
Learning from Spatial Data with Local Information-Theoretic Measures
Analyzing Dynamical Systems with Global Information-Theoretic Measures
The Effect of Induced Perturbations in the System
Considerations and Final Remarks
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call