The DOI matches its Crossref record.
Topology of random clique complexes
Open accessAbstract
In a seminal paper, Erdos and Renyi identified a sharp threshold for connectivity of the random graph G(n,p). In particular, they showed that if [email protected]?logn/n then G(n,p) is almost always connected, and if [email protected]?logn/n then G(n,p) is almost always disconnected, as n->~. The clique complexX(H) of a graph H is the simplicial complex with all complete subgraphs of H as its faces. In contrast to the zeroth homology group of X(H), which measures the number of connected components of H, the higher dimensional homology groups of X(H) do not correspond to monotone graph properties. There are nevertheless higher dimensional analogues of the Erdos-Renyi Theorem. We study here the higher homology groups of X(G(n,p)). For k>0 we show the following. If p=n^@a, with @a -1/(2k+1), then the kth homology group of X(G(n,p)) is almost always vanishing, and if -1/k<@a<-1/(k+1), then it is almost always nonvanishing. We also give estimates for the expected rank of homology, and exhibit explicit nontrivial classes in the nonvanishing regime. These estimates suggest that almost all d-dimensional clique complexes have only one nonvanishing dimension of homology, and we cannot rule out the possibility that they are homotopy equivalent to wedges of a spheres.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Simplicial models of social contagion
Iacopini, I., Petri, G., Barrat, A., & Latora, V. (2019) · Nature Communications · doi:10.1038/s41467-019-10431-6 · Cited by 879
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
Clique topology reveals intrinsic geometric structure in neural correlations
Giusti, C., Pastalkova, E., Curto, C., & Itskov, V. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1506407112 · Cited by 381
Statistical ranking and combinatorial Hodge theory
Jiang, X., Lim, L.-H., Yao, Y., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0419-x · Cited by 335
Metadata
- Authors
- Kahle, M.
- Venue
- Discrete Mathematics
- Publisher
- Elsevier BV
- Published
- 2009-04
- Volume
- 309
- Issue
- 6
- Pages
- 1658-1671
- ISSN
- 0012-365X (ISSN-L)
- OpenAlex
- W2097040817
- Cited by
- 182
- References
- 0
- FWCI
- 7.84
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Topology of random clique complexes. https://app.cochat.ai/papers/10.1016/j.disc.2008.02.037
- The paper
- Kahle, M. (2009). Topology of random clique complexes. Discrete Mathematics. https://doi.org/10.1016/j.disc.2008.02.037
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.