Narrow Results

Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a sub-hypergraph, we define some maps on the space of probability functions on sub-hypergraphs of $L$. We study the compositions of these maps as well as their actions on the space of probability functions.

Random hypergraphs and random simplicial complexes on finite vertices were studied by [M. Farber, L. Mead and T. Nowik, Random simplicial complexes, duality and the critical dimension, J. Topol. Anal.41(1) (2022) 1–32]. The map algebra on random sub-hypergraphs of a fixed simplicial complex, which detects relations between random sub-hypergraphs and random simplicial sub-complexes, was studied by the authors of this paper. In this paper, we study the map algebra on random sub-hypergraphs of a fixed hypergraph. We give some algorithms generating random hypergraphs and random simplicial complexes by considering the actions of the map algebra on the space of probability distributions. We prove some Künneth-type formulae for random hypergraphs and random simplicial complexes on finite vertices.