Directed flag complex lifting (graph to simplicial complex)

[tgebhart]

This pull request implements the directed clique (flag) complex lifting of a graph to a simplicial complex. The directed clique complex differs from its undirected counterpart in that it only accounts for k-simplices for which the (k+1)-clique is acyclic.

This implementation largely mirrors that of the clique complex lifting with the major change being an acceptance of directed networks as input data and the bookkeeping required to detect allowable simplices from each clique.

See the following references for more information on the directed clique complex.

[1] Reimann, Michael W., et al. "Cliques of neurons bound into cavities provide a missing link between structure and function." Frontiers in computational neuroscience 11 (2017): 266051.
[2] Lütgehetmann, Daniel, et al. "Computing persistent homology of directed flag complexes." Algorithms 13.1 (2020): 19.

[review-notebook-app]

Check out this pull request on 

See visual diffs & provide feedback on Jupyter Notebooks.

---

Powered by ReviewNB

[gbg141]

Hello @tgebhart! Thank you for your submission. As we near the end of the challenge, I am collecting participant info for the purpose of selecting and announcing winners. Please email me (or have one member of your team email me) at guillermo_bernardez@ucsb.edu so I can share access to the voting form. In your email, please include:

• your first and last name (as well as any other team members)
• the title of the method you implemented
• the input domain of the method you implemented
• the output domain of the method you implemented
• your pull request number (Directed flag complex lifting (graph to simplicial complex) #44)

Before July 12, make sure that your submission respects all Submission Requirements laid out on the challenge page. Any submission that fails to meet this criteria will be automatically disqualified.