Subhypergraphs in non-uniform random hypergraphs
From MaRDI portal
Publication:6284685
arXiv1703.07686MaRDI QIDQ6284685FDOQ6284685
Paweł Prałat, Benjamin Reiniger, Xavier Pérez-Giménez, Megan Dewar, John J. Healy, John Proos, Kirill Ternovsky
Publication date: 22 March 2017
Abstract: In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable approach. We begin by defining a generalization of the binomial random graph model to hypergraphs and formalizing several definitions of subhypergraph. The bulk of the paper focusses on determining the expected existence of these types of subhypergraph in random hypergraphs. We also touch on the problem of determining whether a given subgraph appearing in the 2-section is likely to have been induced by a certain subhypergraph in the hypergraph. To evaluate the model in relation to real-world data, we compare model prediction to two datasets with respect to (1) the existence of certain small subhypergraphs, and (2) a clustering coefficient.
This page was built for publication: Subhypergraphs in non-uniform random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284685)
