Flag Complex

Given any graph, the flag complex (or clique complex) is the maximal simplicial complex containing a graph as its 1-skeleton. Otherwise said, whenever there appears to be the boundary of a simplex, one fills it in.

The Vietoris-Rips complex is the flag complex associated with the distance-$\varepsilon$ proximity graph of a point cloud vertex set $\Omega$.


Topics in Topological Data Analysis


Topics in Graph Theory, Networks, and Econophysics

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License