Papers
Topics
Authors
Recent
Search
2000 character limit reached

Topology of random d-clique complexes

Published 6 Jun 2018 in math.CO and math.AT | (1806.02234v1)

Abstract: For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n{\alpha}$, with $\alpha < \max{\frac{-1}{k-d +1},-\frac{d+1}{\binom{k}{d}}}$ or $\alpha > \frac{-1}{\binom{2k+2}{d}}$, then the $k$-th reduced homology group of the random $d$-clique complex $\Delta_d(G_d(n,p))$ is asymptotically almost surely vanishing, and if $\frac{-1}{t} < \alpha < \frac{-1}{t+1}$ where $t = (\frac{(d+1)(k+1)}{\binom{(d+1)(k+1)}{d+1}-(k+1)}){-1}$, then the $(kd + d -1)$-st reduced homology group of $\Delta_d(G_d(n,p))$ is asymptotically almost surely nonvanishing. This provides a partial answer to a question posed by Eric Babson.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.