arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.08618q-bio.NC
收藏

Dale网络的组合码与图规则

The combinatorial code and the graph rules of Dale networks

Nikola Milićević, Vladimir Itskov

AI总结:

本文研究了满足Dale定律的阈值线性网络中神经元的组合码,发现其由网络连通图和突触矩阵谱条件决定,并证明了弱耦合下组合码为子格,强耦合下为凸码。

摘要:

我们描述了满足Dale定律的阈值线性网络中神经元平衡态和稳态的组合学。Dale网络的组合码由两个条件刻画:(i)关于网络连通图的条件,以及(ii)关于突触矩阵的谱条件。我们发现在弱耦合机制下,组合码仅依赖于连通图,而不依赖于突触强度的细节。此外,我们证明了弱耦合网络的组合码是一个子格,并提供了一种学习规则用于在弱耦合兴奋性网络中编码子格。在强耦合机制下,我们证明了一般Dale网络的组合码是交集完备的,因此是凸码,这在大脑的某些感觉系统中很常见。

英文摘要:

We describe the combinatorics of equilibria and steady states of neurons in threshold-linear networks that satisfy Dale's law. The combinatorial code of a Dale network is characterized in terms of two conditions: (i) a condition on the network connectivity graph, and (ii) a spectral condition on the synaptic matrix. We find that in the weak coupling regime the combinatorial code depends only on the connectivity graph, and not on the particulars of the synaptic strengths. Moreover, we prove that the combinatorial code of a weakly coupled network is a sublattice, and we provide a learning rule for encoding a sublattice in a weakly coupled excitatory network. In the strong coupling regime we prove that the combinatorial code of a generic Dale network is intersection-complete and is therefore a convex code, as is common in some sensory systems in the brain.

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

↑