Generations of random hypergraphs and random simplicial complexes by the map algebra
From MaRDI portal
Abstract: We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the (lower-)associated independence hypergraph of the random hypergraph in terms of the probability distributions of certain random simplicial complex and certain random independence hypergraph of Erd"os-R'enyi type. We construct a graded structure of the map algebra explicitly and give algorithms to generate random hypergraphs and random simplicial complexes.
This page was built for publication: Generations of random hypergraphs and random simplicial complexes by the map algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405311)
