Explosion of Branching Processes

Finding sufficient conditions for infinitely large branching processes

Bachelor Thesis (2024)
Author(s)

T. Berkhout (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

J. Komjáthy – Mentor (TU Delft - Applied Probability)

Faculty
Electrical Engineering, Mathematics and Computer Science
More Info
expand_more
Publication Year
2024
Language
English
Graduation Date
25-06-2024
Awarding Institution
Delft University of Technology
Project
['CSE3000 Research Project']
Programme
['Computer Science and Engineering']
Faculty
Electrical Engineering, Mathematics and Computer Science
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

We provide sufficient criteria for explosion in an age-dependent branching pro- cess. For this, we assume the offspring distribution is a variation of a Pareto distribution, as the chance to get at least k children is a slowly varying function over k. Given this form, we will construct a lower bound on the generation sizes. After we obtained this lower bound, we will start a process in which we will thin the tree. We will do this by pruning the children of an individual if that individual is born after its assigned time. Doing this for all generations gives rise to a thinned tree, with infinitely many non-empty generations in a finite time. Because of that, there are infinitely many individuals at a finite time, and thus the tree exploded. There is a constraint needed, dependent on the offspring distribution, for the thinned tree to survive. The goal of this thesis is to find that constraint.

Files

License info not available