Clique complexes and graph powers

We study the behaviour of clique complexes of graphs under the operation of taking graph powers. As an example we compute the clique complexes of powers of cycles, or, in other words, the independence complexes of circular complete graphs.Comment: V3: final versio

The Vietoris-Rips complexes of a circle

Given a metric space X and a distance threshold r>0, the Vietoris-Rips simplicial complex has as its simplices the finite subsets of X of diameter less than r. A theorem of Jean-Claude Hausmann states that if X is a Riemannian manifold and r is sufficiently small, then the Vietoris-Rips complex is homotopy equivalent to the original manifold. Little is known about the behavior of Vietoris-Rips complexes for larger values of r, even though these complexes arise naturally in applications using persistent homology. We show that as r increases, the Vietoris-Rips complex of the circle obtains the homotopy types of the circle, the 3-sphere, the 5-sphere, the 7-sphere, ..., until finally it is contractible. As our main tool we introduce a directed graph invariant, the winding fraction, which in some sense is dual to the circular chromatic number. Using the winding fraction we classify the homotopy types of the Vietoris-Rips complex of an arbitrary (possibly infinite) subset of the circle, and we study the expected homotopy type of the Vietoris-Rips complex of a uniformly random sample from the circle. Moreover, we show that as the distance parameter increases, the ambient Cech complex of the circle also obtains the homotopy types of the circle, the 3-sphere, the 5-sphere, the 7-sphere, ..., until finally it is contractible.Comment: Final versio

Nerve complexes of circular arcs

We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Second, we show that the Lovasz bound on the chromatic number of a circular complete graph is either sharp or off by one. Third, we show that the Vietoris--Rips simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time O(n log n)

Duality of Graphical Models and Tensor Networks

In this article we show the duality between tensor networks and undirected graphical models with discrete variables. We study tensor networks on hypergraphs, which we call tensor hypernetworks. We show that the tensor hypernetwork on a hypergraph exactly corresponds to the graphical model given by the dual hypergraph. We translate various notions under duality. For example, marginalization in a graphical model is dual to contraction in the tensor network. Algorithms also translate under duality. We show that belief propagation corresponds to a known algorithm for tensor network contraction. This article is a reminder that the research areas of graphical models and tensor networks can benefit from interaction

On Vietoris-Rips complexes of ellipses

For $X$ a metric space and $r>0$ a scale parameter, the Vietoris-Rips complex $VR_<(X;r)$ (resp. $VR_\leq(X;r)$) has $X$ as its vertex set, and a finite subset $\sigma\subseteq X$ as a simplex whenever the diameter of $\sigma$ is less than $r$ (resp. at most $r$). Though Vietoris-Rips complexes have been studied at small choices of scale by Hausmann and Latschev, they are not well-understood at larger scale parameters. In this paper we investigate the homotopy types of Vietoris-Rips complexes of ellipses $Y=\{(x,y)\in \mathbb{R}^2~|~(x/a)^2+y^2=1\}$ of small eccentricity, meaning $1<a\le\sqrt{2}$. Indeed, we show there are constants $r_1 < r_2$ such that for all $r_1 < r< r_2$, we have $VR_<(X;r)\simeq S^2$ and $VR_\leq(X;r)\simeq \bigvee^5 S^2$, though only one of the two-spheres in $VR_\leq(X;r)$ is persistent. Furthermore, we show that for any scale parameter $r_1 < r < r_2$, there are arbitrarily dense subsets of the ellipse such that the Vietoris-Rips complex of the subset is not homotopy equivalent to the Vietoris-Rips complex of the entire ellipse. As our main tool we link these homotopy types to the structure of infinite cyclic graphs

Complexes of not ii-connected graphs

Complexes of (not) connected graphs, hypergraphs and their homology appear in the construction of knot invariants given by V. Vassiliev. In this paper we study the complexes of not $i$-connected $k$-hypergraphs on $n$ vertices. We show that the complex of not $2$-connected graphs has the homotopy type of a wedge of $(n-2)!$ spheres of dimension $2n-5$. This answers one of the questions raised by Vassiliev in connection with knot invariants. For this case the $S_n$-action on the homology of the complex is also determined. For complexes of not $2$-connected $k$-hypergraphs we provide a formula for the generating function of the Euler characteristic, and we introduce certain lattices of graphs that encode their topology. We also present partial results for some other cases. In particular, we show that the complex of not $(n-2)$-connected graphs is Alexander dual to the complex of partial matchings of the complete graph. For not $(n-3)$-connected graphs we provide a formula for the generating function of the Euler characteristic

Hom complexes and homotopy theory in the category of graphs

We investigate a notion of $\times$-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph $\times$-homotopy is characterized by the topological properties of the \Hom complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; \Hom complexes were introduced by Lov\'{a}sz and further studied by Babson and Kozlov to give topological bounds on chromatic number. Along the way, we also establish some structural properties of \Hom complexes involving products and exponentials of graphs, as well as a symmetry result which can be used to reprove a theorem of Kozlov involving foldings of graphs. Graph $\times$-homotopy naturally leads to a notion of homotopy equivalence which we show has several equivalent characterizations. We apply the notions of $\times$-homotopy equivalence to the class of dismantlable graphs to get a list of conditions that again characterize these. We end with a discussion of graph homotopies arising from other internal homs, including the construction of `$A$-theory' associated to the cartesian product in the category of reflexive graphs.Comment: 28 pages, 13 figures, final version, to be published in European J. Com