Given a graph $G$, we define a filtration of simplicial complexes associated to $G$, $\mathcal{F}_0(G)\subseteq\mathcal{F}_1(G)\subseteq\cdots\subseteq\mathcal{F}_\infty(G)$ where the first complex is the independence complex and the last the complex is formed by the acyclic sets of vertices. We prove some properties of this filtration and we calculate the homotopy type for various families of graphs. We give an upper bound for the decycling number and generalizations of this parameter using the dimensions of the rational cohomology groups of these complexes. We also derive an upper bound for the Fibonacci numbers of ternary graphs.
Filtration-Based Representation Learning for Temporal Graphs
Indian Institute of Science Education and Research Tirupati(印度科学教育与研究学院 Tirupati);Chennai Mathematical Institute(钦奈数学研究所);Institut Polytechnique de Paris(巴黎高等技术学院)
Motif-based filtrations for persistent homology: A framework for graph isomorphism and property prediction
Center for Complex Networks and Systems Research, Luddy School of Informatics, Computing, and Engineering, Indiana University(印第安纳大学卢迪信息、计算与工程学院复杂网络与系统研究中心);Delft University of Technology(代尔夫特理工大学);Universitat de Barcelona(巴塞罗那大学);Institute of Complex Systems (UBICS), Universitat de Barcelona(巴塞罗那大学复杂系统研究所);ICREA(加泰罗尼亚高级研究院)