A Computational Approach to Population-Size-Dependent Branching Processes

Computational methods for a specific class of size-independent branching processes called Markovian binary trees (MBTs) have been developed recently. The corresponding computational methods, which are called matrix analytic methods, focus on algorithms that have a clear probabilistic interpretation. The aim of this project is to adapt these computational methods to address fundamental questions on population-size-dependent branching processes (PSDBPs). In particular, the project will focus on general birth-and-death processes with a carrying capacity whose birth and death rates depend on current population sizes and on MBTs with population-size-dependent transition rates.

Minyuan Li

The University of Melbourne

Minyuan Li is a third-year Bachelor of Science student at the University of Melbourne, majoring in mathematics and statistics. She enjoys solving mathematical problems, particularly in the area of statistics and stochastic processes. Last year, Minyuan completed a supervised summer project in applied probability, which involved investigating the properties of probabilistic models using mathematical software. The experience gave her the opportunity to develop an interest in mathematical research and motivated her to pursue further studies in the areas related to mathematics.

You may be interested in

Huan Chen

Huan Chen

Random Walks (Generic) and Their Applications
Tiana Tsang Ung

Tiana Tsang Ung

Computational Searches for Combinatorial Designs
Patrick Donovan

Patrick Donovan

Uniqueness of Einstein Metrics
Jaco van Tonder

Jaco van Tonder

Special Solutions to the Ricci Flow on 4-Dimensional Principal Bundles
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.