Random Growth Processes on Graphs

DSpace Repository


URI: http://hdl.handle.net/10900/129867
Dokumentart: PhDThesis
Date: 2022-10-01
Language: English
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Mathematik
Advisor: Zerner, Martin (Prof. Dr.)
Day of Oral Examination: 2022-04-29
DDC Classifikation: 510 - Mathematics
Other Keywords: Verzweigungsprozesse
Autoregressive Prozesse
ballistisches Wachstum
Boolesche Perkolation
Branching process
Autoregressive Process
ballistic growth
Boolean percolation
License: http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en
Order a printed copy: Print-on-Demand
Show full item record


In the present thesis, we consider three different random graph-theoretic growth models. These models are called ballistic deposition on finite graphs, Boolean percolation on directed graphs, and supercritical Galton-Watson branching processes with emigration. For our ballistic deposition model on finite graphs, we obtain various results, which characterize the relationship between the asymptotic growth rate and the underyling graph. Moreover, we prove that the fluctuations around this growth rate always satisfy a central limit theorem. In the context of Boolean percolation, we clarify under which conditions all but finitely many points of the graphs N_0^n and Z^n are covered. We also prove, for n ≥ 2, that it is impossible to cover the directed n-ary tree in this model. Besides, we present connections between this percolation model and the so-called random exchange process. Finally, we study under which conditions supercritical branching processes with emigration become extinct almost surely, and whether the expected survival time is finite. We investigate the extinction probability in relation to the population size, and the asymptotic growth of the population. To some extent, supercritical branching processes with emigration behave similarly to subcritical branching processes with immigration.

This item appears in the following Collection(s)