Related papers: The double of a simplicial complex
We introduce a filtration on the simplicial homology of a finite simplicial complex X using bi-colourings of its vertices. This yields two dual homology theories closely related to discrete Morse matchings on X. We give an explicit…
We explain how to interpret the complexes arising in the "classical" homology stability argument (e.g. in the framework of Randal-Williams--Wahl) in terms of higher algebra, which leads to a new proof of homological stability in this…
We present a formula for determining synchronizability in large, randomized and weighted simplicial complexes. This formula leverages eigenratios and costs to assess complete synchronizability under diverse network topologies and intensity…
For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…
This paper presents three short, new proofs of Dowker duality using various poset fiber lemmas. We introduce modifications of joins and products of simplicial complexes called relational join and relational product complexes. These…
We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of…
We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…
The stability analysis of synchronization in time-varying higher-order networked structures (simplicial complexes) is one of the challenging problem due to the presence of time-varying group interactions. In this context, most of the…
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its zero-th and first…
We prove that every simplicial complex is the dual complex of some simple normal crossing divisor in a smooth variety. As an application, we simplify and extend the results of Kapovich--Koll\'ar (math.AG:1109.4047) on the existence of…
Hypergraphs have seen widespread application in network and data science communities in recent years. We present a survey of recent work to construct auxiliary structures from hypergraphs -- specifically simplicial, relative, and chain…
A general method for constructing simplicial complex from observed time series of dynamical systems based on the delay coordinate reconstruction procedure is presented. The obtained simplicial complex preserves all pertinent topological…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital…
In this note, we outline the general development of a theory of symmetric homology of algebras, an analog of cyclic homology where the cyclic groups are replaced by symmetric groups. This theory is developed using the framework of crossed…
Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models…
The dynamics of large complex systems are predominately modeled through pairwise interactions, the principle underlying structure being a network of the form of a digraph or quiver. Significant success has been obtained in applying the…