Ayat Ababneh | Searcharxiv

arXiv2026

Random chain complexes of real vector spaces

We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes. For chain complexes of length $1$ or $2$, we characterize the Betti numbers almost surely, in terms of the dimensions of the vector spaces. We further examine complexes of length $3$ with some constraints on dimensions, as well as complexes of arbitrary finite length in which all vector spaces have equal dimension. Across all these settings, we show that the sum of the Betti numbers is almost surely as small as possible, attaining a trivial lower bound $|χ|$ dictated by the dimensions of the underlying vector spaces and the Euler formula. These results suggest an underlying algebraic heuristic for a phenomenon frequently observed in stochastic topology, that nontrivial homology rarely appears unless forced to.

math.PR↗

arXiv2022

Maximal persistence in random clique complexes

We study the persistent homology of an Erdős--Rényi 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 $σ$ is defined as $p_2 / p_1$, where $p_1$ and $p_2$ are the birth and death times of the cycle respectively. We show that for fixed $k \ge 1$, with high probability the maximal persistence of a $k$-cycle is of order roughly $n^{1/k(k+1)}$. These results are in sharp contrast with the random geometric setting where earlier work by Bobrowski, Kahle, and Skraba shows that for random Čech and Vietoris--Rips filtrations, the maximal persistence of a $k$-cycle is much smaller, of order $\left(\log n / \log \log n \right)^{1/k}$.

math.CO↗