Related papers: Graphs and Their Vietoris-Rips Complexes Have the …
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
The efficiency of extracting topological information from point data depends largely on the complex that is built on top of the data points. From a computational viewpoint, the most favored complexes for this purpose have so far been…
Given a diagram of Pi-algebras (graded groups equipped with an action of the primary homotopy operations), we ask whether it can be realized as the homotopy groups of a diagram of spaces. The answer given here is in the form of an…
Motivated by constructions in topological data analysis and algebraic combinatorics, we study homotopy theory on the category of Cech closure spaces $\mathbf{Cl}$, the category whose objects are sets endowed with a Cech closure operator and…
For a locally finite connected graph $X$ we consider the group $Maps(X)$ of proper homotopy equivalences of $X$. We show that it has a natural Polish group topology, and we propose these groups as an analog of big mapping class groups. We…
We inspect Vietoris-Rips complexes $VR_t(X)$ of certain metric spaces $X$ using a new generalization of Bestvina-Brady discrete Morse theory. Our main result is a pair of metric criteria on $X$, called the Morse Criterion and Link…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
We determine the homotopy type of the Vietoris-Rips complexes of the (vertex sets of the) platonic solids. The most interesting case is that the Vietoris-Rips complex of the dodecahedron is a wedge of nine 3-spheres when the parameter is…
By analogy with methods of Spivak, there is a realization functor which takes a persistence diagram $Y$ in simplicial sets to an extended pseudo-metric space (or ep-metric space) $Re(Y)$. The functor $Re$ has a right adjoint, called the…
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…
We show that the category of graphs has the structure of a 2-category with homotopy as the 2-cells. We then develop an explicit description of homotopies for finite graphs, in terms of what we call `spider moves'. We then create a category…
We show that the category of coalgebras for the compact Vietoris endofunctor $\mathbb{V}$ on the category Top of topological spaces and continuous mappings is isomorphic to the category of all modally saturated Kripke structures. Extending…
We provide novel lower bounds on the Betti numbers of Vietoris-Rips complexes of hypercube graphs of all dimensions, and at all scales. In more detail, let $Q_n$ be the vertex set of $2^n$ vertices in the $n$-dimensional hypercube graph,…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we…
A minimally rigid graph, also called Laman graph, models a planar framework which is rigid for a general choice of distances between its vertices. In other words, there are finitely many ways, up to isometries, to realize such a graph in…
We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.
Discrete homotopy theory or A-homotopy theory is a combinatorial homotopy theory defined on graphs, simplicial complexes, and metric spaces, reflecting information about their connectivity. The present paper aims to further understand the…
The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…
In line with the recent development in topological graph theory, we are considering undirected graphs that are allowed to contain {\em multiple edges}, {\em loops}, and {\em semi-edges}. A graph is called {\em simple} if it contains no…