<?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-21T04:03:04Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/17213" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/17213</identifier><datestamp>2026-09-24T20:02:07Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Hurd, Thomas R.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Pourbabaee, Mohammad Farzad</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mathematics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-04-27T14:45:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-04-27T14:45:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2015-06</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/17213</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/21024</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A random graph model is introduced, which is supposed to capture the assortativity effect in various real-world networks. An effect that appears when different types of vertices have non-uniform tendencies to connect to each other. Therefore, given the node- and edge-type distributions P, Q a discrete matching method is developed, so that the empirical distributions asymptotically passes to their given limits P, Q. Applications of martingale convergence methods are exploited to prove the large n limits of the discrete Markov setup. Finally, the relation between inhomogeneous random graph model as another recently studied topic and our model is investigated.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Dissertation</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Assortative Configuration Random Graphs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>