Related papers: Homological connectivity of random hypergraphs
We study when co-evolving (or adaptive) higher-order networks defined on directed hypergraphs admit a simplicial description. Binary and triadic couplings are modelled by time-dependent weight tensors. Using representation theory of the…
We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…
This paper expands on and refines some known and less well-known results about the finite subset spaces of a simplicial complex $X$ including their connectivity and their top homology groups. It also discusses the inclusion of the…
We prove that if G is a graph without 3-cycles and 4-cycles, then the discrete cubical homology of G is trivial in dimension d, for all d\ge 2. We also construct a sequence { G_d } of graphs such that this homology is non-trivial in…
The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality. In the first part of the paper we concentrate…
Motivated by applications in Topological Data Analysis, we consider decompositions of a simplicial complex induced by a cover of its vertices. We study how the homotopy type of such decompositions approximates the homotopy of the simplicial…
In [Discrete differential calculus on simplicial complexes and constrained homology, Chin. Ann. Math. Ser. B 44(4), 615-640, 2023], the constrained (co)homology for simplicial complexes and independence hypergraphs is constructed via…
We show that the Hamiltonian Lagrangian monodromy group, in its homological version, is trivial for any weakly exact Lagrangian submanifold of a symplectic manifold. The proof relies on a sheaf approach to Floer homology given by a relative…
We prove the following monotonicity result for the holonomy group: Given a sequence of metric connections converging in $C^0$ such that all its members have holonomy contained in a closed group $H$, also their limit connection needs to have…
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
We study the homological properties of random simplicial complexes. In particular, we obtain the asymptotic behavior of lifetime sums for a class of increasing random simplicial complexes; this result is a higher-dimensional counterpart of…
While sporadic examples of virtual resolutions with homology have been constructed, their occurrence is not well understood or controlled. Our results build a new set of tools for studying virtual resolutions of monomial ideals as arising…
A strongly connected graph is strongly biconnected if after ignoring the direction of its edges we have an undirected graph with no articulation points. A 3-vertex strongly biconnected graph is a strongly biconnected digraph that has the…
We prove that every finite connected simplicial complex has the homology of the classifying space for some $\mathrm{CAT}(0)$ cubical duality group. More specifically, for any finite simplicial complex $X$, we construct a locally…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
We demonstrate how some problems arising in simplicial quantum gravity can be successfully addressed within the framework of combinatorial group theory. In particular, we argue that the number of simplicial 3-manifolds having a fixed…
We study the expected topological properties of Cech and Vietoris-Rips complexes built on i.i.d. random points in R^d. We find higher dimensional analogues of known results for connectivity and component counts for random geometric graphs.…