arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.18924q-bio.NCmath.PR
收藏

马尔可夫过程与脑网络枢纽

Markov Processes and Brain Network Hubs

M. Ram Murty, A. Narayan Prasad

AI总结:

本文将大脑神经网络建模为有向图并引入Markov矩阵形成连续Markov过程,假设网络枢纽为平稳分布中概率最高的节点,并推导出图直径基于矩阵特征值的新上界。

摘要:

神经网络的概念经历了两个世纪的进展,从神经元学说发展到了神经元细胞集合的概念。目前,神经网络模型涉及由节点、枢纽和连接组成的分布式神经回路,这些回路在不同的脑功能状态下是动态的。神经生理学、神经影像学和连接组学领域的进展推动了图论数学概念的应用。当前的方法确实存在局限性,且取得的结果存在不一致性。我们将大脑的神经网络建模为有向图,并为每对不同的节点附加一个转移概率矩阵(称为Markov矩阵,由突触强度决定),从而产生一个(连续)Markov过程。我们假设网络枢纽是由Markov理论的平稳分布给出的具有最高概率的节点。我们还推导出了图直径的一个新的上界,该上界用Markov矩阵的特征值表示。

英文摘要:

Current concepts of neural networks have emerged over two centuries of progress beginning with the neural doctrine to the idea of neural cell assemblies. Presently the model of neural networks involves distributed neural circuits of nodes, hubs, and connections that are dynamic in different states of brain function. Advances in neurophysiology, neuroimaging and the field of connectomics have given impetus to the application of mathematical concepts of graph theory. Current approaches do carry limitations and inconsistency in results achieved. We model the neural network of the brain as a directed graph and attach a matrix (called the Markov matrix) of transition probabilities (determined by the synaptic strengths) to every pair of distinct nodes giving rise to a (continuous) Markov process. We postulate that the network hubs are the nodes with the highest probabilities given by the stationary distribution of Markov theory. We also derive a new upper bound for the diameter of a graph in terms of the eigenvalues of the Markov matrix.

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

↑