SearcharxivSearch

arXiv · 2112.09683

Galton-Watson processes and their role as building blocks for branching processes

Abstract

This article is an essay, both expository and argumentative, on the Galton-Watson process as a tool in the domain of Branching Processes. It is at the same time the author's ways to honour two distinguished scientists in this domain, both from the Russian Academy of Science, and to congratulate them for their special birthdays coming up very soon. The thread of the article is the role, which the Galton-Watson process had played in the author's own research. We start with an article on a controlled Galton-Watson process. Then we pass to random absorbing processes, and also recall and discuss a problem in medicine. Further questions will bring us via the Borel-Cantelli Lemma to $\varphi$-branching processes and extensions. To gain more generality, we then look at bisexual Galton-Watson processes. Finally we briefly discuss relatively complicated resource dependent branching processes to show that, here again, using Galton-Watson reproduction schemes (whenever reasonable) can be a convincing approach to new processes which are then sufficiently tractable to obtain results of interest. Keywords: Controlled branching process; $\varphi$-branching process, Bisexual reproduction, Borel-Cantelli Lemma; Resource dependence; Society forms, Stopping times, Theorem of envelopment, BRS-inequality.

Explore related subjects

Keep this discovery

BibTeXRIS

F. Thomas Bruss. 2021-12-17. Galton-Watson processes and their role as building blocks for branching processes. https://arxiv.org/abs/2112.09683

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR