Sampling hypergraphs with given degrees
From MaRDI portal
Publication:1981695
DOI10.1016/j.disc.2021.112566zbMath1472.05117arXiv2006.12021OpenAlexW3118942110MaRDI QIDQ1981695
Publication date: 6 September 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.12021
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- A sequential algorithm for generating random graphs
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Fast uniform generation of regular graphs
- An efficient MCMC algorithm to sample binary matrices with fixed marginals
- The switch Markov chain for sampling irregular graphs and digraphs
- Towards random uniform sampling of bipartite graphs with given degree sequence
- Approximate counting of regular hypergraphs
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Uniform generation of random regular graphs of moderate degree
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Uniform Generation of Random Regular Graphs
- Configuration models of random hypergraphs
- Rapid mixing of the switch Markov chain for strongly stable degree sequences
- Hypergraphic Degree Sequences are Hard
- Sampling Regular Graphs and a Peer-to-Peer Network
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Sampling binary contingency tables with a greedy start
This page was built for publication: Sampling hypergraphs with given degrees
