Related papers: Flagifying the Dowker Complex
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…
The dual complex can be associated to any resolution of singularities whose exceptional set is a divisor with simple normal crossings. It generalizes to higher dimensions the notion of the dual graph of a resolution of surface singularity.…
We propose a topological framework for the detection of Hopf bifurcations directly from time series, based on persistent homology applied to phase space reconstructions via Takens embedding within the framework of Topological Data Analysis.…
The aim of this paper is to introduce a certain number of tools and results suitable for the study of valuations of higher rank on function fields of algebraic varieties. This will be based on a study of higher rank quasi-monomial…
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…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
The matching complex of a simple graph $G$ is a simplicial complex consisting of the matchings on $G$. Jeli\'c Milutinovi\'c et al. studied the matching complexes of the polygonal line tilings, and they gave a lower bound for the…
Two channels are said to be equivalent if they are degraded from each other. The space of equivalent channels with input alphabet $X$ and output alphabet $Y$ can be naturally endowed with the quotient of the Euclidean topology by the…
We introduce a new `geometric realization' of an (abstract) simplicial complex, inspired by probability theory. This space (and its completion) is a metric space, which has the right (weak) homotopy type, and which can be compared with the…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
Two related constructions are studied: (1) The diagonal complex $\mathcal{D}$ and its barycentric subdivision $\mathcal{BD}$ related to a \textit{punctured} oriented surface $F$ equipped with a number of labeled marked points. (2) The…
The dual complex associated to a resolution of singularities generalizes the notion of a resolution graph of a surface singularity to any dimension. We show that homotopy type of the dual complex is an invariant of an isolated singularity.
A new type of collective excitations, due exclusively to the topology of a complex random network that can be characterized by a fractal dimension $D_F$, is investigated. We show analytically that these excitations generate phase…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
Discrete de Rham (DDR) methods provide non-conforming but compatible approximations of the continuous de Rham complex on general polytopal meshes. Owing to the non-conformity, several challenges arise in the analysis of these methods. In…
Clustering aims to form groups of similar data points in an unsupervised regime. Yet, clustering complex datasets containing critically intertwined shapes poses significant challenges. The prevailing clustering algorithms widely depend on…
Dynamical decoupling (DD) is a well-known open-loop protocol for suppressing unwanted interactions in a quantum system, thereby drastically extending the coherence time of useful quantum states. In the original framework of evolution…
This paper introduces Fourier duality for a class of affine iterated function systems (IFS) T_i. These systems are determined by a finite family of contractive affine maps in R^d. Our Fourier duality applies to the resulting probability…
Duality results connecting persistence modules for absolute and relative homology provides a fundamental understanding into persistence theory. In this paper, we study similar associations in the context of zigzag persistence. Our main…