Saved in:
Bibliographic Details
Main Authors: Murty, M. Ram, Prasad, A. Narayan
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2407.18924
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913448356478976
author Murty, M. Ram
Prasad, A. Narayan
author_facet Murty, M. Ram
Prasad, A. Narayan
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2407_18924
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Markov Processes and Brain Network Hubs
Murty, M. Ram
Prasad, A. Narayan
Neurons and Cognition
Probability
60J10, 60J20
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.
title Markov Processes and Brain Network Hubs
topic Neurons and Cognition
Probability
60J10, 60J20
url https://arxiv.org/abs/2407.18924