<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T12:44:36Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4987" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4987</identifier><datestamp>2017-03-21T17:44:52Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="82c85d3c-20dc-488a-990e-2709fdebb42c" confidence="600">Gao, Pu</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-01-22T20:26:57Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-01-22T20:26:57Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-01-22T20:26:57Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4987</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study a new method of generating random $d$-regular graphs by&#xd;
repeatedly applying an operation called pegging.  The pegging&#xd;
algorithm, which applies the pegging operation in each step, is a&#xd;
method of generating large random regular graphs beginning with&#xd;
small ones. We prove that the limiting joint distribution of the&#xd;
numbers of short cycles in the resulting graph is independent&#xd;
Poisson. We use the coupling method to bound the total variation&#xd;
distance between the joint distribution of short cycle counts and&#xd;
its limit and thereby show that $O(\epsilon^{-1})$ is an upper bound&#xd;
of the $\eps$-mixing time. The coupling involves two different,&#xd;
though quite similar, Markov chains that are not time-homogeneous.&#xd;
We also show that the $\epsilon$-mixing time is not&#xd;
$o(\epsilon^{-1})$. This demonstrates that the upper bound&#xd;
 is essentially tight. We study also the&#xd;
connectivity of random $d$-regular graphs generated by the pegging&#xd;
algorithm. We show that these graphs are asymptotically almost&#xd;
surely $d$-connected for any even constant $d\ge 4$.&#xd;
&#xd;
&#xd;
The problem of orientation of random hypergraphs is motivated by the&#xd;
classical load balancing problem. Let $h&amp;gt;w&amp;gt;0$ be two fixed integers.&#xd;
Let $\orH$ be a hypergraph whose hyperedges are uniformly of size&#xd;
$h$.&#xd;
 To {\em $w$-orient} a hyperedge, we assign exactly $w$ of its&#xd;
vertices positive signs with respect to this hyperedge, and the rest&#xd;
negative.  A $(w,k)$-orientation of $\orH$ consists of a&#xd;
$w$-orientation of all hyperedges of $\orH$, such that each vertex&#xd;
receives at most $k$ positive signs from its incident hyperedges.&#xd;
When $k$ is large enough, we determine the threshold of the&#xd;
existence of a $(w,k)$-orientation of a random hypergraph. The&#xd;
$(w,k)$-orientation of hypergraphs is strongly related to a general&#xd;
version of the off-line load balancing problem.&#xd;
&#xd;
&#xd;
The other topic we discuss is computing the probability of induced&#xd;
subgraphs in a random regular graph. Let $0&amp;lt;s&amp;lt;n$ and $H$ be a graph&#xd;
on $s$ vertices. For any $S\subset [n]$ with $|S|=s$, we compute the&#xd;
probability that the subgraph of $\mathcal{G}_{n,d}$ induced by $S$&#xd;
is $H$. The result holds for any $d=o(n^{1/3})$ and is further&#xd;
extended to $\mathcal{G}_{n,{\bf d}}$, the probability space of&#xd;
random graphs with given degree sequence $\bf d$. This result&#xd;
provides a basic tool for studying properties, for instance the&#xd;
existence or the counts, of certain types of induced subgraphs.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">random graph</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">load balancing</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Generation and properties of random graphs and analysis of randomized algorithms</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>