Sampling hypergraphs with given degrees
Authors:
- Martin DyerMartin Dyer
- Catherine GreenhillCatherine Greenhill
- Pieter KleerPKPieter Kleer
- James RossJRJames Ross
- Leen StougieLeen Stougie
- 1 November 2021
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 344 (11)
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (024.002.003, EP/S016562/1, DP190100977)
- Engineering and Physical Sciences Research Council (024.002.003, EP/S016562/1, DP190100977)
- Australian Research Council (024.002.003, EP/S016562/1, DP190100977)
This publication has 16 references indexed in Scilit:
- Approximate counting of regular hypergraphsInformation Processing Letters, 2013
- Predicting protein interactions via parsimonious network history inferenceBioinformatics, 2013
- A Sequential Algorithm for Generating Random GraphsAlgorithmica, 2009
- Sampling Regular Graphs and a Peer-to-Peer NetworkCombinatorics, Probability and Computing, 2007
- Sampling binary contingency tables with a greedy startRandom Structures & Algorithms, 2006
- Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sumsJournal of Combinatorial Theory, Series A, 2006
- Sequential Monte Carlo Methods for Statistical Analysis of TablesJournal of the American Statistical Association, 2005
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entriesJournal of the ACM, 2004
- Fast uniform generation of regular graphsTheoretical Computer Science, 1990
- Uniform generation of random regular graphs of moderate degreeJournal of Algorithms, 1990