An application of neighbourhoods in digraphs to the classification of binary dynamics.

ABSTRACT: A binary state on a graph means an assignment of binary values to its vertices. A time-dependent sequence of binary states is referred to as binary dynamics. We describe a method for the classification of binary dynamics of digraphs, using particular choices of closed neighbourhoods. Our motivation and application comes from neuroscience, where a directed graph is an abstraction of neurons and their connections, and where the simplification of large amounts of data is key to any computation. We present a topological/graph theoretic method for extracting information out of binary dynamics on a graph, based on a selection of a relatively small number of vertices and their neighbourhoods. We consider existing and introduce new real-valued functions on closed neighbourhoods, comparing them by

SUBMITTER: Conceicao P 

PROVIDER: S-EPMC9208003 | biostudies-literature | 2022 Jun

REPOSITORIES: biostudies-literature