Uniform random colored complexes

We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to those random graphs, such as their number of connected components or the number of vertices of their dual complexes, as $p \to \infty$. The techniques involved in the study of these quantities also yield a Central Limit Theorem for the genus of a uniform map of order $p$, as $p \to \infty$.Comment: 36 pages, 9 figures, minor additions and correction

High-Dimensional Expanders from Expanders

We present an elementary way to transform an expander graph into a simplicial complex where all high order random walks have a constant spectral gap, i.e., they converge rapidly to the stationary distribution. As an upshot, we obtain new constructions, as well as a natural probabilistic model to sample constant degree high-dimensional expanders. In particular, we show that given an expander graph G, adding self loops to G and taking the tensor product of the modified graph with a high-dimensional expander produces a new high-dimensional expander. Our proof of rapid mixing of high order random walks is based on the decomposable Markov chains framework introduced by [Jerrum et al., 2004]