2020
DOI: 10.48550/arxiv.2006.05333
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Computing Homotopy Types of Directed Flag Complexes

Abstract: Combinatorially and stochastically defined simplicial complexes often have the homotopy type of a wedge of spheres. A prominent conjecture of Kahle quantifies this precisely for the case of random flag complexes. We explore whether such properties might extend to graphs arising from nature. We consider the brain network (as reconstructed by Varshney & al.) of the Caenorhabditis elegans nematode, an important model organism in biology. Using an iterative computational procedure based on elementary methods of al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 33 publications
(63 reference statements)
0
2
0
Order By: Relevance
“…A particular feature of the network is an overrepresentation of reciprocally connected triangle motifs and an underrepresentation of directed triangle cycles. The synaptic connectivity is obtainable from [1] and we used the steps in [22] to construct the directed graph. The graph we used has 279 vertices and 2,194 edges.…”
Section: Data Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…A particular feature of the network is an overrepresentation of reciprocally connected triangle motifs and an underrepresentation of directed triangle cycles. The synaptic connectivity is obtainable from [1] and we used the steps in [22] to construct the directed graph. The graph we used has 279 vertices and 2,194 edges.…”
Section: Data Descriptionmentioning
confidence: 99%
“…Our main example of a topological space on a digraph G is the directed flag complex, which is constructed from the directed cliques of G. For example, a 2-simplex is given by an ordered sequence of vertices (v 0 , v 1 , v 2 ) whenever any ordered pair (v i , v j ), for i < j, is a directed edge in G. By construction the simplices are endowed with an inherent directionality. For a recent work on computing the homotopy type of the directed flag complex of the C. elegans neuronal network, see [22].…”
Section: Introductionmentioning
confidence: 99%