Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 182

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Topology of random clique complexes

Open access
Kahle, Matthew · 2009 · Discrete Mathematics

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.disc.2008.02.037

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cites

Cited by

See all 182

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
1
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

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.