Erratum: Limit theorems for Betti numbers of random simplicial complexes

@article{Kahle2015ErratumLT,
  title={Erratum: Limit theorems for Betti numbers of random simplicial complexes},
  author={Matthew Kahle and Elizabeth S. Meckes},
  journal={arXiv: Probability},
  year={2015}
}
We correct the proofs of the main theorems in our paper "Limit theorems for Betti numbers of random simplicial complexes". 

Figures from this paper

Topology of random geometric complexes: a survey
TLDR
This article surveys the rapidly emerging area of random geometric simplicial complexes, and reviews the results known to date about the probabilistic behavior of the homology (and related structures) generated by these random complexes.
Limit theorems for process-level Betti numbers for sparse and critical regimes
Abstract The objective of this study is to examine the asymptotic behavior of Betti numbers of Čech complexes treated as stochastic processes and formed from random points in the d-dimensional
Limit theorems for process-level Betti numbers for sparse, critical, and Poisson regimes
The objective of this study is to examine the asymptotic behavior of Betti numbers of \v{C}ech complexes treated as stochastic processes and formed from random points in the $d$-dimensional Euclidean
On the evolution of topology in dynamic clique complexes
Abstract We consider a time varying analogue of the Erdős–Rényi graph and study the topological variations of its associated clique complex. The dynamics of the graph are stationary and are
Limit theorems for Betti numbers of extreme sample clouds with application to persistence barcodes
We investigate the topological dynamics of extreme sample clouds generated by a heavy tail distribution on R by establishing various limit theorems for Betti numbers, a basic quantifier of algebraic
Limit Theorems for the Sum of Persistence Barcodes
Topological Data Analysis (TDA) refers to an approach that uses concepts from algebraic topology to study the "shapes" of datasets. The main focus of this paper is persistent homology, a ubiquitous
On the evolution of topology in dynamic Erd} os-R enyi graphs
We study a time varying analogue of the Erd} os-R enyi graph, which we call the dynamic Erd} os-R enyi graph, and concentrate on the topological aspects of its clique complex. Denoting the graph on n
Gigantic random simplicial complexes
We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost

References

SHOWING 1-10 OF 21 REFERENCES
Limit theorems for Betti numbers of random simplicial complexes
There have been several recent articles studying homology of various types of random simplicial complexes. Several theorems have concerned thresholds for vanishing of homology, and in some cases
Algebraic Topology
The focus of this paper is a proof of the Nielsen-Schreier Theorem, stating that every subgroup of a free group is free, using tools from algebraic topology.
Random graphs
  • A. Frieze
  • Mathematics, Computer Science
    SODA '06
  • 2006
TLDR
Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Random Geometric Complexes
  • Matthew Kahle
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2011
TLDR
The expected topological properties of Čech and Vietoris–Rips complexes built on random points in ℝd are studied and asymptotic formulas for the expectation of the Betti numbers in the sparser regimes, and bounds in the denser regimes are given.
The fundamental group of random 2-complexes
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in
The neighborhood complex of a random graph
Sharp vanishing thresholds for cohomology of random flag complexes
For every $k \ge 1$, the $k$th cohomology group $H^k(X, \Q)$ of the random flag complex $X \sim X(n,p)$ passes through two phase transitions: one where it appears, and one where it vanishes. We
Topology of random clique complexes
Random Geometric Graphs
TLDR
This chapter discusses probabilistic ingredients, the largest component for a binomial process, and connectedivity and the number of components in a graph-like model.
...
...