Beyond inverse Ising model: structure of the analytical solution for a class of inverse problems
arXiv:1209.1787 · doi:10.1007/s10955-013-0707-y
Abstract
I consider the problem of deriving couplings of a statistical model from measured correlations, a task which generalizes the well-known inverse Ising problem. After reminding that such problem can be mapped on the one of expressing the entropy of a system as a function of its corresponding observables, I show the conditions under which this can be done without resorting to iterative algorithms. I find that inverse problems are local (the inverse Fisher information is sparse) whenever the corresponding models have a factorized form, and the entropy can be split in a sum of small cluster contributions. I illustrate these ideas through two examples (the Ising model on a tree and the one-dimensional periodic chain with arbitrary order interaction) and support the results with numerical simulations. The extension of these methods to more general scenarios is finally discussed.
15 pages, 6 figures
References in corpus (10)
- Identification of direct residue contacts in protein-protein interaction by message passing
- Small-correlation expansions for the inverse Ising problem
- Mean Field Theory For Non-Equilibrium Network Reconstruction
- Adaptive cluster expansion for the inverse Ising problem: convergence, algorithm and tests
- The Bethe approximation for solving the inverse Ising problem: a comparison with other inference methods
- Specialization of strategies and herding behavior of trading firms in a financial market
- Bethe-Peierls approximation and the inverse Ising model
- Inference algorithms for gene networks: a statistical mechanics analysis
- Dynamics and Performance of Susceptibility Propagation on Synthetic Data
- Inverse Ising problem for one-dimensional chains with arbitrary finite-range couplings