Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2509.06559 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911142772736000 |
|---|---|
| author | Mészáros, András |
| author_facet | Mészáros, András |
| contents | We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to prove results about the homology of random $2$-dimensional simplicial complexes.
More specifically, we prove that if $T_n$ is a random $2$-dimensional determinantal hypertree on $n$ vertices and $p$ is any prime, then \[\frac{\dim H_1(T_n,\mathbb{F}_p)}{n^2}\] converges to zero in probability. The same result holds for random $1$-out 2-complexes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_06559 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Using dense graph limit theory to count cocycles of random simplicial complexes Mészáros, András Combinatorics We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to prove results about the homology of random $2$-dimensional simplicial complexes. More specifically, we prove that if $T_n$ is a random $2$-dimensional determinantal hypertree on $n$ vertices and $p$ is any prime, then \[\frac{\dim H_1(T_n,\mathbb{F}_p)}{n^2}\] converges to zero in probability. The same result holds for random $1$-out 2-complexes. |
| title | Using dense graph limit theory to count cocycles of random simplicial complexes |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.06559 |