Abstract | ||
---|---|---|
The random 2-dimensional simplicial complex process starts with a complete graph on vertices, and in every step a new 2-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to 1 as , the first homology group over vanishes at the very moment when all the edges are covered by triangular faces. |
Year | DOI | Venue |
---|---|---|
2018 | https://doi.org/10.1007/s00454-017-9938-z | Discrete & Computational Geometry |
Keywords | Field | DocType |
Random simplicial complexes,Hitting time,Homology Shadow,05E45,05C80 | Complete graph,Discrete mathematics,Combinatorics,Betti number,Simplicial approximation theorem,Vertex (geometry),Simplicial homology,Simplicial complex,h-vector,Mathematics,Abstract simplicial complex | Journal |
Volume | Issue | ISSN |
59 | 1 | 0179-5376 |
Citations | PageRank | References |
1 | 0.40 | 4 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tomasz Łuczak | 1 | 225 | 40.26 |
Yuval Peled | 2 | 8 | 3.22 |