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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of combinatorics Jg. 29; H. 2; S. 227 - 272
Hauptverfasser:	van Ieperen, Femke, Kryven, Ivan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Switzerland Springer Nature B.V 01.06.2025 Springer International Publishing
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!