Related papers: Integral homology of random simplicial complexes

Given a chain complex with the only modification that each cell of the complex has a probability distribution assigned. We will call this complex - a random complex and what should be understood in practice, is that we have a classical…

This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…

Let $r \ge 2$ be a fixed constant and let $ {\mathcal H}$ be an $r$-uniform, $D$-regular hypergraph on $N$ vertices. Assume further that $ D \to \infty$ as $N \to \infty$ and that degrees of pairs of vertices in ${\mathcal H}$ are at most…

We show that for a complete complex algebraic variety the pure component of homology coincides with the image of intersection homology. Therefore pure homology is topologically invariant. To obtain slightly more general results we introduce…

In this paper we study the problem of determining the homology groups of a quotient of a topological space by an action of a group. The method is to represent the original topological space as a homotopy limit of a diagram, and then act…

A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…

We define two different simplicial complexes, the common divisor simplicial complex and the prime divisor simplicial complex, from a set of integers, and explore their similarities. We will define a map between the two simplicial complexes,…

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the…

In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…

We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…

We study the first homology group of the mapping class group and Torelli group with coefficients in the first rational homology group of the universal abelian cover of the surface. We prove two contrasting results: for surfaces with one…

We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be…

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

We study the homology of simplicial complexes built via deterministic rules from a random set of vertices. In particular, we show that, depending on the randomness that generates the vertices, the homology of these complexes can either…

This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…

We consider closed simplicial and cubical $n$-complexes in terms of link of their $(n-2)$-faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2)$-face is contained in 3 or 4 $n$-faces. Such simplicial…

A central objective of topological data analysis is to identify topologically significant features in data represented as a finite point cloud. We consider the setting where the ambient space of the point sample is a compact Riemannian…