Related papers: Persistent Betti numbers of random \v{C}ech comple…
We study cohomological properties of complex manifolds. In particular, under suitable metric conditions, we extend to higher dimensions a result by A. Teleman, which provides an upper bound for the Bott-Chern cohomology in terms of Betti…
In this paper we state the homological domination principle for random multi-parameter simplicial complexes, claiming that the Betti number in one specific dimension (which is explicitly determined by the probability multi-parameter)…
In this paper we present a new approach to computing homology (with field coefficients) and persistent homology. We use concepts from discrete Morse theory, to provide an algorithm which can be expressed solely in terms of simple graph…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
Topological Data Analysis (TDA), a relatively new field of data analysis, has proved very useful in a variety of applications. The main persistence tool from TDA is persistent homology in which data structure is examined at many scales.…
We provide a framework for studying randomly coloured point sets in a locally compact, second-countable space on which a metrisable unimodular group acts continuously and properly. We first construct and describe an appropriate dynamical…
We study the persistent homology of an Erd\H{o}s--R\'enyi random clique complex filtration on $n$ vertices. Here, each edge $e$ appears at a time $p_e \in [0,1]$ chosen uniform randomly in the interval, and the \emph{persistence} of a cycle…
Topologically ordered phases of matter display a number of unique characteristics, including ground states that can be interpreted as patterns of closed strings. In this paper, we consider the problem of detecting and distinguishing closed…
We introduce the multineighbor complex of a graph, which is a simplicial complex in which a simplex is a subset of the graph with a sufficient number of mutual neighbors. We investigate the asymptotic homological properties of such…
Topological invariants have played a fundamental role in the advancement of theoretical high energy physics. Physicists have used several kinematic techniques to distinguish new physics predictions from the Standard Model (SM) of particle…
Persistent homology studies the evolution of k-dimensional holes along a nested sequence of simplicial complexes (called a filtration). The set of bars (i.e. intervals) representing birth and death times of k-dimensional holes along such…
The theory of multidimensional persistent homology was initially developed in the discrete setting, and involved the study of simplicial complexes filtered through an ordering of the simplices. Later, stability properties of…
In this work, we construct a persistent version of the well-known Leray spectral sequence. More precisely, we construct a spectral sequence that computes the persistent cohomology of a space from the persistent cohomology in each open set…
This note concerns the asymptotics of the expected total Betti numbers of the nodal set for an important class of Gaussian ensembles of random fields on Riemannian manifolds. By working with the limit random field defined on the Euclidean…
Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.
The objective of this article is to investigate the asymptotic behavior of the persistence diagrams of a random cubical filtration as the window size tends to infinity. Here, a random cubical filtration is an increasing family of random…
Let $X$ be a closed subspace of a metric space $M$. Under mild hypotheses, one can estimate the Betti numbers of $X$ from a finite set $P \subset M$ of points approximating $X$. In this paper, we show that one can also use $P$ to estimate…
The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme…