Uniform Generation of Graphical Realizations of Joint Degree Matrices
| dc.contributor.author | Zhou, Qianye | |
| dc.date.accessioned | 2023-09-21T12:55:36Z | |
| dc.date.available | 2023-09-21T12:55:36Z | |
| dc.date.issued | 2023-09-21 | |
| dc.date.submitted | 2023-09-13 | |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/19901 | |
| dc.language.iso | en | en |
| dc.pending | false | |
| dc.publisher | University of Waterloo | en |
| dc.subject | random graph theory | en |
| dc.subject | graph generation | en |
| dc.subject | probabilistic method | en |
| dc.title | Uniform Generation of Graphical Realizations of Joint Degree Matrices | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws-etd.degree.discipline | Combinatorics and Optimization | en |
| uws-etd.degree.grantor | University of Waterloo | en |
| uws-etd.embargo.terms | 0 | en |
| uws.contributor.advisor | Gao, Jane | |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.published.city | Waterloo | en |
| uws.published.country | Canada | en |
| uws.published.province | Ontario | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |