Uniformly sampling random directed hypergraphs with fixed degrees

DOI10.1016/J.DISC.2025.114961MaRDI QIDQ6846079zbMATH OpenFDO

Authors Yanna J. Kraakman, Clara Stegehuis

Publication date 12 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114961

zbMATH Keywords

directed hypergraphsrandom graphsMarkov chain Monte Carlo samplinguniform sampling

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Hypergraphs (05C65)

Cites work

• scientific article; zbMATH DE number 1089130 (Why is no real title available?)
• A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• Configuration models of random hypergraphs
• Configuring random graph models with fixed degree sequences
• Hypercurveball algorithm for sampling hypergraphs with fixed degrees
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Sampling Random Graphs with Specified Degree Sequences
• Sampling Regular Graphs and a Peer-to-Peer Network
• Switching edges to randomize networks : What goes wrong and how to fix it
• The connectivity of graphs of graphs with self-loops and a given degree sequence
• The mixing time of switch Markov chains: a unified approach
• The theory of regular graphs
• Uniform sampling of digraphs with a fixed degree sequence
• What Are Higher-Order Networks?

This page was built for publication: Uniformly sampling random directed hypergraphs with fixed degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846079)