Randomized algorithms to generate hypergraphs with given degree sequences
From MaRDI portal
Cites work
- A remark on the existence of finite graphs
- A tomographical interpretation of a sufficient condition on h-graphical sequences
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Characterization and reconstruction of hypergraphic pattern sequences
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
- Configuration models of random hypergraphs
- Degree Sequences in Complexes and Hypergraphs
- Discrete tomography. Foundations, algorithms, and applications
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Limit laws for self-loops and multiple edges in the configuration model
- New results on degree sequences of uniform hypergraphs
- New sufficient conditions on the degree sequences of uniform hypergraphs
- On graphic and 3-hypergraphic sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Optimization over degree sequences
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Properties of unique degree sequences of 3-uniform hypergraphs
- Random graphs and complex networks. Volume 1
- Random hypergraph processes with degree restrictions
- Sampling hypergraphs with given degrees
- Seven criteria for integer sequences being graphic
- The probabilistic method
- The probability that a random multigraph is simple
This page was built for publication: Randomized algorithms to generate hypergraphs with given degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987877)
