Degree sequences of sufficiently dense random uniform hypergraphs
Abstract
We find an asymptotic enumeration formula for the number of simple -uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations. We give sufficient conditions on the degree sequence which guarantee existence of a solution to this system. Furthermore, we solve the system and give an explicit asymptotic formula when the degree sequence is close to regular. This allows us to establish several properties of the degree sequence of a random -uniform hypergraph with a given number of edges. More specifically, we compare the degree sequence of a random -uniform hypergraph with a given number edges to certain models involving sequences of binomial or hypergeometric random variables conditioned on their sum.
Cite
@article{arxiv.2106.08100,
title = {Degree sequences of sufficiently dense random uniform hypergraphs},
author = {Catherine Greenhill and Mikhail Isaev and Tamás Makai and Brendan D. McKay},
journal= {arXiv preprint arXiv:2106.08100},
year = {2022}
}
Comments
To appear in Combinatorics, Probability and Computing