Simplex Closing Probabilities in Directed Graphs

by   Florian Unger, et al.

Recent work in mathematical neuroscience has calculated the directed graph homology of the directed simplicial complex given by the brains sparse adjacency graph, the so called connectome. These biological connectomes show an abundance of both high-dimensional directed simplices and Betti-numbers in all viable dimensions - in contrast to Erdős-Rényi-graphs of comparable size and density. An analysis of synthetically trained connectomes reveals similar findings, raising questions about the graphs comparability and the nature of origin of the simplices. We present a new method capable of delivering insight into the emergence of simplices and thus simplicial abundance. Our approach allows to easily distinguish simplex-rich connectomes of different origin. The method relies on the novel concept of an almost-d-simplex, that is, a simplex missing exactly one edge, and consequently the almost-d-simplex closing probability by dimension. We also describe a fast algorithm to identify almost-d-simplices in a given graph. Applying this method to biological and artificial data allows us to identify a mechanism responsible for simplex emergence, and suggests this mechanism is responsible for the simplex signature of the excitatory subnetwork of a statistical reconstruction of the mouse primary visual cortex. Our highly optimised code for this new method is publicly available.


page 1

page 2

page 3

page 4


Clustering Edges in Directed Graphs

How do vertices exert influence in graph data? We develop a framework fo...

Metric preserving directed graph symmetrization

This work presents a new method for symmetrization of directed graphs th...

Computing a Feedback Arc Set Using PageRank

We present a new heuristic algorithm for computing a minimum Feedback Ar...

MCMC Sampling of Directed Flag Complexes with Fixed Undirected Graphs

Constructing null models to test the significance of extracted informati...

Fast Approximations for Rooted Connectivity in Weighted Directed Graphs

We consider approximations for computing minimum weighted cuts in direct...

On lossy Compression of Directed Graphs

The method of types presented by Csiszar and Korner is a central tool us...

A Weighted Quiver Kernel using Functor Homology

In this paper, we propose a new homological method to study weighted dir...

Please sign up or login with your details

Forgot password? Click here to reset