UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Uniform Generation of Graphical Realizations of Joint Degree Matrices

Thumbnail Image

Files

Zhou_Qianye.pdf (1.39 MB)

Date

2023-09-21

Authors

Zhou, Qianye

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

In this thesis, we introduce JDM_GEN, an algorithm designed to uniformly generate graphical realizations of a given joint degree matrix. Amanatidis and Kleer previously employed an MCMC-based method to address this problem. Their method fully resolved the case of two degree classes, and showed that their switch Markov chain is rapidly mixing. While our algorithm imposes certain restrictions on the maximum degrees, it is applicable to any bounded number of degree classes and has a runtime complexity linear in the number of edges.​

Description

Keywords

random graph theory, graph generation, probabilistic method

LC Keywords

Citation

URI

http://hdl.handle.net/10012/19901

Collections

Theses
Combinatorics and Optimization