On the sufficiency of pairwise interactions in maximum entropy models of networks

DOI10.1007/S10955-016-1456-5zbMATH Open1359.92043arXiv1505.02831OpenAlexW3122273001MaRDI QIDQ290485FDOQ290485

Authors: Lina Merchan, Ilya Nemenman 

Publication date: 1 June 2016

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Abstract: Biological information processing networks consist of many components, which are coupled by an even larger number of complex multivariate interactions. However, analyses of data sets from fields as diverse as neuroscience, molecular biology, and behavior have reported that observed statistics of states of some biological networks can be approximated well by maximum entropy models with only pairwise interactions among the components. Based on simulations of random Ising spin networks with $p$-spin ($p>2$) interactions, here we argue that this reduction in complexity can be thought of as a natural property of densely interacting networks in certain regimes, and not necessarily as a special property of living systems. By connecting our analysis to the theory of random constraint satisfaction problems, we suggest a reason for why some biological systems may operate in this regime.

Full work available at URL: https://arxiv.org/abs/1505.02831

Recommendations

• A dynamical state underlying the second order maximum entropy principle in neuronal networks
• The simplest maximum entropy model for collective behavior in a neural network
• On the statistical mechanics of probabilistic models of neural networks
• The impact of high-order interactions on the rate of synchronous discharge and information transmission in somatosensory cortex
• Complex networks: structure and dynamics

zbMATH Keywords

collective dynamicsnumerical simulations\(p\)-spin models

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Systems biology, networks (92C42) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known
• Information Theory and Statistical Mechanics
• Neural networks and physical systems with emergent collective computational abilities.
• I-divergence geometry of probability distributions and minimization problems
• Two solutions to diluted \(p\)-spin models and XORSAT problems
• On the freezing of variables in random constraint satisfaction problems
• Small-correlation expansions for the inverse Ising problem
• Are disordered spin glass models relevant for the structural glass problem?
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Are biological systems poised at criticality?
• Learning probabilities from random observables in high dimensions: the maximum entropy distribution and others

Cited In (4)

• Message-passing on hypergraphs: detectability, phase transitions and higher-order information
• Evolution of biomedical innovation quantified via billions of distinct article-level MeSH keyword combinations
• Intrachromosomal regulation decay in breast cancer
• A note on asymptotic distributions in maximum entropy models for networks

This page was built for publication: On the sufficiency of pairwise interactions in maximum entropy models of networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290485)