Related papers: Persistent Betti numbers of random \v{C}ech comple…
We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding…
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
Betti numbers of configuration spaces of mechanical linkages (known also as polygon spaces) depend on a large number of parameters -- the lengths of the bars of the linkage. Motivated by applications in topological robotics, statistical…
This paper studies random cubical sets in $\mathbb{R}^d$. Given a cubical set $X\subset \mathbb{R}^d$, a random variable $\omega_Q\in[0,1]$ is assigned for each elementary cube $Q$ in $X$, and a random cubical set $X(t)$ is defined by the…
Kempe equivalence is a classical and fundamental notion in graph coloring theory. In the present paper we establish a connection between Kempe equivalence and quadratic stable set ring, which are toric rings associated to graphs. In fact,…
The aim of this work is to understand some of the asymptotic properties of sequences of lattices in a fixed locally compact group. In particular we will study the asymptotic growth of the Betti numbers of the lattices renormalized by the…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
We study the asymptotic behavior of the clique number in rank-1 inhomogeneous random graphs, where edge probabilities between vertices are roughly proportional to the product of their vertex weights. We show that the clique number is…
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative…
Homological stability for unordered configuration spaces of connected manifolds was discovered by Th. Church and extended by O. Randal-Williams and B. Knudsen: $H_i(C_k(M);\mathbb{Q})$ is constant for $k\geq f(i)$. We characterize the…
In this paper, we employ the persistent homology (PH) technique to examine the topological properties of fractional Gaussian noise (fGn). We develop the weighted natural visibility graph algorithm, and the associated simplicial complexes…
Persistent homology (PH) is one of the most popular tools in topological data analysis (TDA), while graph theory has had a significant impact on data science. Our earlier work introduced the persistent spectral graph (PSG) theory as a…
We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and…
We study graph complexes related to configuration spaces and diffeomorphism groups of highly connected manifolds of odd dimension. In particular we compute the cohomology in the "high genus" limit. This paper is a continuation of previous…
We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for…
Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
The Linial-Meshulam complex model is a natural higher-dimensional analog of the Erd\H{o}s-R\'enyi graph model. In recent years, Linial and Peled established a limit theorem for Betti numbers of Linial-Meshulam complexes with an appropriate…