Degree sequences of sufficiently dense random uniform hypergraphs
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 …
with a given degree sequence, when the number of edges is sufficiently large. The formula …
Sampling uniform hypergraphs with given degrees
J Ross - 2022 - unsworks.unsw.edu.au
Graphs are combinatorial objects commonly used to model relationships between pairs of
entities. Hypergraphs are a generalization of graphs in which edges connect an arbitrary …
entities. Hypergraphs are a generalization of graphs in which edges connect an arbitrary …
Asymptotic enumeration of sparse uniform hypergraphs, with applications
H Aldosari - 2020 - unsworks.unsw.edu.au
A hypergraph is a generalisation of a graph where the edges may contain more than two
vertices. This thesis concentrates on asymptotic enumeration of some families of sparse …
vertices. This thesis concentrates on asymptotic enumeration of some families of sparse …