Sampling hypergraphs with given degrees - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics Year : 2021

Sampling hypergraphs with given degrees

(1) , (2) , (3) , (2) , (4, 5)
1
2
3
4
5

Abstract

There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite graph. We use this connection to describe and analyse a rejection sampling algorithm for sampling simple uniform hypergraphs with a given degree sequence. Our algorithm uses, as a black box, an algorithm A for sampling bipartite graphs with given degrees, uniformly or nearly uniformly, in (expected) polynomial time. The expected runtime of the hypergraph sampling algorithm depends on the (expected) runtime of the bipartite graph sampling algorithm A, and the probability that a uniformly random bipartite graph with given degrees corresponds to a simple hypergraph. We give some conditions on the hypergraph degree sequence which guarantee that this probability is bounded below by a positive constant.
Fichier principal
Vignette du fichier
2006.12021.pdf (268.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03474025 , version 1 (10-12-2021)

Identifiers

Cite

Martin Dyer, Catherine Greenhill, Pieter Kleer, James Ross, Leen Stougie. Sampling hypergraphs with given degrees. Discrete Mathematics, 2021, 344 (11), pp.1-14. ⟨10.1016/j.disc.2021.112566⟩. ⟨hal-03474025⟩

Collections

INRIA INRIA2
10 View
30 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More