random simplicial complexes
Recently Published Documents


TOTAL DOCUMENTS

28
(FIVE YEARS 12)

H-INDEX

7
(FIVE YEARS 1)

2020 ◽  
Vol 22 (1) ◽  
pp. 297-318
Author(s):  
Jens Grygierek ◽  
Martina Juhnke-Kubitzke ◽  
Matthias Reitzner ◽  
Tim Römer ◽  
Oliver Röndigs

2019 ◽  
pp. 1-31
Author(s):  
Michael Farber ◽  
Lewis Mead ◽  
Tahl Nowik

In this paper, we discuss two general models of random simplicial complexes which we call the lower and the upper models. We show that these models are dual to each other with respect to combinatorial Alexander duality. The behavior of the Betti numbers in the lower model is characterized by the notion of critical dimension, which was introduced by Costa and Farber in [Large random simplicial complexes III: The critical dimension, J. Knot Theory Ramifications 26 (2017) 1740010]: random simplicial complexes in the lower model are homologically approximated by a wedge of spheres of dimension equal the critical dimension. In this paper, we study the Betti numbers in the upper model and introduce new notions of critical dimension and spread. We prove that (under certain conditions) an upper random simplicial complex is homologically approximated by a wedge of spheres of the critical dimension.


Author(s):  
Graham Ellis

This chapter introduces some of the basic concepts of algebraic topology and describes datatypes and algorithms for implementing them on a computer. The basic concepts include: regular CW-complex, non-regular CW-complex, simplicial complex, cubical complex, permutahedral complex, simple homotopy, set of path-components, fundamental group, van Kampen’s theorem, knot quandle, Alexander polynomial of a knot, covering space. These are illustrated using computer examples involving digital images, protein backbones, high-dimensional point cloud data, knot complements, discrete groups, and random simplicial complexes.


Author(s):  
Graham Ellis

This chapter introduces more basic concepts of algebraic topology and describes datatypes and algorithms for implementing them on a computer. The basic concepts include: chain complex, chain mapping, chain homotopy, homology of a (simplicial or cubical or permutahedral or CW-) space, persistent homology of a filtered space, cohomology ring of a space, van Kampen diagrams, excision. These are illustrated using computer examples involving digital images, protein backbones, high-dimensional point cloud data, knot complements, discrete groups, and random simplicial complexes.


Sign in / Sign up

Export Citation Format

Share Document