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

MaRDI QIDQ6365244zbMATH OpenFDO

Authors Pedro Conceição, Dejan Govc, Jānis Lazovskis, Ran Levi, Henri Riihimäki, Jason P. Smith

Publication date 13 April 2021

Has companion code repository https://github.com/JasonPSmith/TriDy

Mathematics Subject Classification ID

Simplicial sets and complexes in algebraic topology (55U10)

Abstract: A binary state on a graph means an assignment of binary values to its vertices. For example, if one encodes a network of spiking neurons as a directed graph, then the spikes produced by the neurons at an instant of time is a binary state on the encoding graph. Allowing time to vary and recording the spiking patterns of the neurons in the network produces an example of binary dynamics on the encoding graph, namely a one-parameter family of binary states on it. The central object of study in this article is the closed neighbourhood of a vertex $v$ in a graph $mathcalG$, namely the subgraph of $mathcalG$ that is induced by $v$ and all its neighbours in $mathcalG$. 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. As a test case we demonstrate an application of the method to binary dynamics that arises from sample activity on the Blue Brain Project reconstruction of cortical tissue of a rat.

This page was built for publication: An application of neighbourhoods in digraphs to the classification of binary dynamics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6365244)