arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0908.1006math.PR
收藏

神经复杂性的概率研究

A probabilistic study of neural complexity

Jerome Buzzi, Lorenzo Zambotti

摘要:

G. Edelman,O. Sporns和G. Tononi引入了随机变量族的神经复杂性,将其定义为子族上互信息的特定平均值。我们表明,他们的选择的权重满足两个自然属性,即可交换性和可加性,我们呼吁任何功能满足这两个属性的错综复杂。我们分类的单位区间上的概率定律的所有错综复杂的增长率的最大错综复杂的系统的大小趋于无穷大。对于一个固定大小的系统,我们表明,极大化有小的支持和可交换系统有小的复杂性。特别是,最大化的复杂性导致自发的对称性破缺和唯一性的失败。

英文摘要:

G. Edelman, O. Sporns, and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural properties, namely exchangeability and additivity, and we call any functional satisfying these two properties an intricacy. We classify all intricacies in terms of probability laws on the unit interval and study the growth rate of maximal intricacies when the size of the system goes to infinity. For systems of a fixed size, we show that maximizers have small support and exchangeable systems have small intricacy. In particular, maximizing intricacy leads to spontaneous symmetry breaking and failure of uniqueness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑