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

Celý popis

Podrobná bibliografie

Vydáno v:	Annals of combinatorics Ročník 29; číslo 2; s. 227 - 272
Hlavní autoři:	van Ieperen, Femke, Kryven, Ivan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Switzerland Springer Nature B.V 01.06.2025 Springer International Publishing
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!