什么时候相关性强?
When are correlations strong?
摘要:
统计力学的逆问题涉及到找到与某些观测到的相关函数集一致的最小哈密顿量。这个问题在生物网络的分析中重新引起了人们的兴趣;特别是,几个这样的网络已经成功地描述了最大熵模型与成对相关性。这些相关性在绝对意义上通常是弱的(例如,相关系数~ 0.1或更小),这有时被视为反对网络中存在有趣的集体行为的证据。如果相关性很弱,应该可以在微扰论中捕捉到它们的影响,所以我们发展了伊辛系统熵的相关性幂展开,将其扩展到四阶。然后,我们考虑最近关于神经元网络的工作[Schneidman等人,Nature 440,1007(2006); Tkacik等人,arXiv:0912.5409 [q-bio.NC](2009)],并表明即使所有的成对相关性都很弱,但这些相关性普遍存在的事实意味着它们对整个网络的影响并没有被微扰理论的主要阶数所捕获。更积极的是,这意味着最近最大熵方法的成功不仅仅是相关性弱的结果。
英文摘要:
The inverse problem of statistical mechanics involves finding the minimal Hamiltonian that is consistent with some observed set of correlation functions. This problem has received renewed interest in the analysis of biological networks; in particular, several such networks have been described successfully by maximum entropy models consistent with pairwise correlations. These correlations are usually weak in an absolute sense (e.g., correlation coefficients ~ 0.1 or less), and this is sometimes taken as evidence against the existence of interesting collective behavior in the network. If correlations are weak, it should be possible to capture their effects in perturbation theory, so we develop an expansion for the entropy of Ising systems in powers of the correlations, carrying this out to fourth order. We then consider recent work on networks of neurons [Schneidman et al., Nature 440, 1007 (2006); Tkacik et al., arXiv:0912.5409 [q-bio.NC] (2009)], and show that even though all pairwise correlations are weak, the fact that these correlations are widespread means that their impact on the network as a whole is not captured in the leading orders of perturbation theory. More positively, this means that recent successes of maximum entropy approaches are not simply the result of correlations being weak.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。