B ETTI NUMBERS OF RANDOM SIMPLICIAL COMPLEXES MATTHEW KAHLE & ELIZABETH MECKE Presented by Ariel Szapiro

INTRODUCTION : BETTI NUMBERS Informally, the k th Betti number refers to the number of unconnected k-dimensional surfaces. The first few Betti numbers have the following intuitive definitions: β 0 is the number of connected components β 1 is the number of two-dimensional holes or handles β 2 is the number of three-dimensional holes or voids etc …

INTRODUCTION : BETTI NUMBERS Similarity to bar codes method, Betti numbers can also tell you a lot about the topology of an examined space or object. Suppose we sample random points from a given object. Its corresponding Betti numbers are a vector of random variables β k. Understanding how β k is distributed can shed a lot of light about the original space or object. Shown here are some interesting bounds and relation of β k for three well known random objects.

ERDOS - R ENYI RANDOM CLIQUE COMPLEXE Erdos-Renyi random graph Definition : The Erdos-Renyi random graph G(n, p) is the probability space of all graphs on vertex set [n] = {1, 2,..., n} with each edge included independently with probability p. clique complex The clique complex X(H) of a graph H is the simplicial complex with vertex set V(H) and a face for each set of vertices spanning a complete subgraph of H i.e. clique. Erdos-Renyi random clique complex is simply X(G(n, p))

ERDOS - R ENYI RANDOM CLIQUE COMPLEXE EXAMPLE Let say we are in an instance of Erdos-Renyi random graph with n=5 and p= Simplexes complex with dimension: 0 are all the dots 1 are all the lines 2 are all the triangels What are the Betti numbers ?

RANDOM C ECH & R IPS COMPLEX The random Rips complex The random Cech complex

RANDOM C ECH & R IPS COMPLEX Random geometric graph Definition: Let f : R d R be a probability density function, let x 1, x 2,..., x n be a sequence of independent and identically distributed d-dimensional random variables with common density f, and let X n = {x 1, x 2,..., x n }. The geometric random graph G(X n ; r) is the geometric graph with vertices X n, and edges between every pair of vertices u, v with d(u, v) r.

RANDOM C ECH & R IPS COMPLEX EXAMPLE AND DIFFERENCES Let say we are in an instance of random geometric graph with n =5 and r = In Cech configuration the Simplexes are:In Rips configuration the Simplexes are:

ERDOS - R ENYI RANDOM CLIQUE COMPLEXE MAIN RESULTS Theorem on Expectation Central limit theorem

ERDOS - R ENYI RANDOM CLIQUE COMPLEXE MAIN RESULTS

RANDOM CECH & R IPS COMPLEX MAIN RESULTS There are four main ranges i.e. regimes, with qualitatively different behavior in each, for different values of r, the ranges are : SUBCRITICAL - CRITICAL - SUPERCRITICAL - CONNECTED – Note – since the results for Cech and Rips complexes are very similar we will ignore the former.

RANDOM CECH & RIPS COMPLEX MAIN RESULTS - SUBCRITICAL In the Subcritical regime the simplicial complexes that is constructed from the random geometric graph G(X n ; r) intuitively, has many disconnected pieces. In this regime the writes shows: Theorem on Expectation and Variance (for Rips Complexes)

RANDOM CECH & RIPS COMPLEX MAIN RESULTS - SUBCRITICAL Central limit Theorem A very interesting outcome from the previous Theorem is that you can know a.a.s in this regime that:

RANDOM CECH & RIPS COMPLEX MAIN RESULTS - CRITICAL In the Critical regime the expectation of all the Betti numbers grow linearly, we will see that this is the maximal rate of growth for every Betti number from r = 0 to infinty. In this regime the writes shows: Theorem on Expectation (for Rips Complexes)

RANDOM CECH & R IPS COMPLEX MAIN RESULTS - SUPERCRITICAL In the Supercritical regime the writes shows an upper bound on the expectation of Betti numbers. This illustrate that it grows sub-linearly, thus the linear growth of the Betti numbers in the critical regime is maximal In this regime the writes shows: Theorem on Expectation (for Rips Complexes)

RANDOM CECH & RIPS COMPLEX MAIN RESULTS - CONNECTED In the Connected regime the graph becomes fully connected w.h.p for the uniform distribution on a convex body In this regime the writes shows: Theorem on connectivity

METHODS OF WORK The main techniques/mode of work to obtain the nice theorems presented here are: First move the problem topology into a combinatorial one -this is done mainly with the help of Morse theory Second use expectation and probably properties to obtain the requested theorem Lets take for Example the Theorem on Expectation for Erdos-Renyi random clique complexes :

METHODS OF WORK – FIRST STAGE The writers uses the following inequality (proven by Allen Hatcher. In Algebraic topology) : Where f i donates the number of i-dimensional simplexes. In the Erdos-Renyi case this is simply the number of (k + 1)-cliques in the original graph. Thus we obtain:

METHODS OF WORK – SECOND STAGE Now we only need to finish the proof, we know by now that : Thus we only need to squeeze the k-Betti number and obtain the desire result.

SUMMERY Three types of random generated complexes were presented Theories on expectation and on statistic behavior of their Betti numbers was given, for each one of the four regimes (in Rips case) And the basic working technique the writers used was presented