Back to search

McMaster University

BRANCHING PROCESS REPRESENTATION OF POISSONIZED CHINESE-RESTAURANT PROCESS [OCRP(α, 0)]

Abstract

dc:description.abstract

The Chinese Restaurant Process (CRP) is a stochastic process on partitions. One of its importance lies in Markov chain Monte Carlo algorithm for Bayesian non parametric clustering. This thesis is built in the realm of a special type of CRP called Poissonized up-down CRP. Inspired by Roger’s work 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 to Poissonized up down CRP. This study touches on discrete trees, continuous trees namely chronological trees, Jumping Chronological Contour Process (JCCP) and Skewer process. In the course of this study we explored interesting identities involving conditional exponential distribution.

Degree

thesis:*
Department dc:contributor.department
Mathematics and Statistics
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kundu, Soumyajyoti
Advisor dc:contributor.advisor
  • Forman, Noah

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Kundu, Soumyajyoti. BRANCHING PROCESS REPRESENTATION OF POISSONIZED CHINESE-RESTAURANT PROCESS [OCRP(α, 0)]. 2024. http://hdl.handle.net/11375/29763