3 citations · 3 across the 2 of their papers we have counts for
5 papers
Ample simplicial complexes
Chaim Even-Zohar, Michael Farber, Lewis Mead
Motivated by potential applications in network theory, engineering and computer science, we study -ample simplicial complexes. These complexes can be viewed as finite approximat…
The Rado Simplicial Complex
Michael Farber, Lewis Mead, Lewin Strauss
A Rado simplicial complex X is a generalisation of the well-known Rado graph. X is a countable simplicial complex which contains any countable simplicial complex as its induced sub…
Enumerating the class of minimally path connected simplicial complexes
Lewis Mead
In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of -dimensional simplicial comple…
Random Simplicial Complexes in the Medial Regime
Michael Farber, Lewis Mead
We describe topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters approach nei…
Random Simplicial Complexes, Duality and The Critical Dimension
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 respe…