<?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:29:08Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/29763" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/29763</identifier><datestamp>2026-09-24T22:59:28Z</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">Forman, Noah</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Kundu, Soumyajyoti</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mathematics and Statistics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-05-07T19:15:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-05-07T19:15:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/29763</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/17940</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">The Chinese Restaurant Process (CRP) is a stochastic process on partitions.&#xd;
One of its importance lies in Markov chain Monte Carlo algorithm for Bayesian&#xd;
non parametric clustering. This thesis is built in the realm of a special type&#xd;
of CRP called Poissonized up-down CRP. Inspired by Roger’s work&#xd;
to recover CRPs from a continuous-time stochastic process called a Lévy process, we study a branching process construction that we show is equivalent&#xd;
to Poissonized up down CRP. This study touches on discrete trees, continuous trees namely chronological trees, Jumping Chronological Contour Process&#xd;
(JCCP) and Skewer process. In the course of this study we explored interesting&#xd;
identities involving conditional exponential distribution.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</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">BRANCHING PROCESS REPRESENTATION OF POISSONIZED CHINESE-RESTAURANT PROCESS [OCRP(α, 0)]</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>