Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence

We discuss sequential stub matching for directed graphs and show that this process can be used to sample simple digraphs with asymptotically equal probability. The process starts with an empty edge set and repeatedly adds edges to it with a certain state-dependent bias until the desired degree seque...

Full description

Bibliographic Details

Published in:	Annals of combinatorics Vol. 29; no. 2; pp. 227 - 272
Main Authors:	van Ieperen, Femke, Kryven, Ivan
Format:	Journal Article
Language:	English
Published:	Switzerland Springer Nature B.V 01.06.2025 Springer International Publishing
Subjects:	Algorithms Codes Combinatorial analysis Estimates Expected values Graph theory Graphs Matching Original Paper Random variables Sampling Randomised approximation algorithms Random graphs Directed graphs
ISSN:	0218-0006, 0219-3094
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!