Abstract
We prove local convergence results for rerooted conditioned multitype Galton–Watson trees. The limit objects are multitype variants of the random sintree constructed by Aldous (1991), and differ according to which types recur infinitely often along the backwards growing spine.
Introduction
The study of multitype branching processes has received growing attention in recent literature, see [1, 5, 7, 9, 13, 14, 18, 24]. The reducible case received particular attention in the line of research by [6, 9, 11, 25,26,27,28]. Multitype Galton–Watson trees are also related to numerous examples of random graphs and discrete structures, see [12, 15, 19, 20, 22].^{Footnote 1}
In the present work, we prove concentration inequalities for the number of extended fringe subtrees for conditioned multitype Galton–Watson trees, see Lemma 1. This allows us to establish local convergence for conditioned multitype Galton–Watson trees rerooted at a random location under general assumptions, see Theorems 1, 2, and 3. The limit objects are multitype generalization of Aldous’ invariant random sintree, and hence generalize similar objects for monotype trees, see [2, 10, 21]. Such trees consist of a rootvertex with an infinite line of ancestors, called the spine, from which further random trees branch off. Depending on the branching mechanism, certain types recur infinitely often along the spine, and others do not.
We apply our results to the following four settings:

1.
Sesquitype trees, whose offspring distribution is critical and has finite variance, conditioned having a total number n of vertices, regardless of their type. See Theorem 4.

2.
Reducible multitype Galton–Watson trees conditioned on having n vertices. See Theorem 5.

3.
Irreducible regular critical multitype Galton–Watson trees conditioned on the event that a fixed linear combination of the subpopulations by type equals n. See Theorem 6.

4.
Irreducible critical multitype Galton–Watson trees conditioned on having a vector \(\varvec{k}(n) \in \mathbb {N}_0^d\) as total population by types. See Theorem 7.
Notation
We let \(\mathbb {N}_0 = \{0,1,2,\ldots \}\) denote the collection of nonnegative integers. The random variables in this paper are either canonical or defined some probability space \((\varOmega ,\mathcal {F},\mathbb {P})\). The law of a random variable \(X: \varOmega \rightarrow S\) with values in some measurable space S is denoted by \(\mathfrak {L}(X)\). If \(Y: \varOmega \rightarrow S'\) is a random variable with values in some measurable space \(S'\), we let \(\mathfrak {L}(X \mid Y)\) denote the conditional law of X given Y. All unspecified limits are taken as \(n \rightarrow \infty \). Convergence in probability and distribution are denoted by \(\,{\buildrel p \over \longrightarrow }\,\) and \(\,{\buildrel d \over \longrightarrow }\,\). Almost sure convergence is denoted by \(\,{\buildrel a.s. \over \longrightarrow }\,\). We say an event holds with high probability if its probability tends to 1 as n becomes large. For any sequence \(a_n>0\) we let \(o_p(a_n)\) denote an unspecified random variable \(Z_n\) such that \(Z_n / a_n \,{\buildrel p \over \longrightarrow }\,0\). Likewise, \(O_p(a_n)\) denotes a random variable \(Z_n\) such that \(Z_n / a_n\) is stochastically bounded.
Index of Terminology
The following list summarizes frequently used terminology.

\(\mathfrak {G}\) A collection of vertex types, page 3.

\(\varvec{\sigma }\) An ordered \(\mathfrak {G}\)offspring distribution with \(\varvec{\sigma } = (\varvec{\sigma }_i)_{i \in \mathfrak {G}}\), page 6.

\(\varvec{\xi }\) The unordered \(\mathfrak {G}\)offspring distribution \(\varvec{\xi } = (\varvec{\xi }_i)_{i \in \mathfrak {G}}\) corresponding to \(\varvec{\sigma }\), page 6.

\(\#_i(\cdot )\) Number of vertices of type \(i \in \mathfrak {G}\), page 4.

\(\#(\cdot )\) Total number of vertices, page 4.

\(\varvec{T}\) A \(\varvec{\sigma }\)Galton–Watson tree with random root type \(\alpha \), page 6.

\(\varvec{T}^\alpha \) Like \(\varvec{T}\), but nonroot vertices of type \(\kappa \) receive no offspring, page 7.

\(\varvec{T}^\kappa \) Like \(\varvec{T}^\alpha \), but root has type \(\kappa \), page 7.

\(N_T(\cdot )\) Number of occurrences of some tree T as a fringe subtree, page 7.

\(\varvec{T}(\kappa )\) Like \(\varvec{T}\), but root has type \(\kappa \), page 8.

\(\varvec{T}_n\) The tree \(\varvec{T}\) conditioned on some event \(\mathcal {E}_n\), page 8.

\(\hat{\varvec{T}}^\kappa \) A random tree with a marked leaf of type \(\kappa \). Distributed like \(\varvec{T}^\kappa \) biased by the number of vertices with type \(\kappa \), page 10.

\(\hat{\varvec{T}}(\kappa )\) A random infinite tree with a marked vertex of type \(\kappa \) and a spine that grows backwards, page 10.

\(\hat{\varvec{T}}^{\kappa ,\gamma }\) A random tree with root type \(\kappa \) and a marked vertex of type \(\gamma \). Obtained by biasing \(\varvec{T}^{\kappa }\) by the number of vertices of type \(\gamma \), page 11.

\(\hat{\varvec{T}}(\kappa , \gamma )\) A random infinite tree with a marked vertex of type \(\gamma \) and a spine that grows backwards, page 12.
Basic Definitions
Multitype Plane Trees
Suppose we are given a countable nonempty set \(\mathfrak {G}\) whose elements we call types. A \(\mathfrak {G}\)type plane tree is a plane tree together with a map that assigns to each vertex a type from \(\mathfrak {G}\).
In the present work we only consider trees where each vertex has a finite number of children. Such trees are called locally finite. In a locally finite \(\mathfrak {G}\)type tree, the offspring of any vertex is encoded by a word from the free monoid
Here \(\mathfrak {G}^0 = \{\emptyset \}\) corresponds to the case where there is no offspring at all.
To any word from \(\langle \mathfrak {G} \rangle \) we may assign a vector from the coproduct \(\mathbb {N}_0^{(\mathfrak {G})}\), that is, the collection of all functions \(\mathfrak {G} \rightarrow \mathbb {N}_0\) that are zero everywhere except for a finite number of types. Here the jth coordinate of the vector corresponds to the number of occurrences of a type \(j \in \mathfrak {G}\) in the word. (For example, if \(\mathfrak {G} = \{a,b,c\}\) is a threeelement set, then the word \((a,c,c,a,b,a) \in \langle \mathfrak {G} \rangle \) corresponds to the vector \((x_i)_{i \in \{a,b,c\}} \in \mathbb {N}_0^{(\mathfrak {G})}\) with \(x_a = 3\), \(x_b = 1\), and \(x_c = 2\).)
For any \(\mathfrak {G}\)tree T and any type \(i\in \mathfrak {G}\) we let
denote the number of vertices of type i in T. Furthermore,
denotes the total number of vertices. We say T is finite, if \(\# T < \infty \).
Marked Trees
Let T denote a locally finite \(\mathfrak {G}\)type tree and let \(v \in T\) be one of its vertices. We say the tree T is marked at v. The pair (T, v) is called a marked tree. The directed path from v to the root of T is called the spine. The tree f(T, v) formed by v and all its descendants is called the fringe subtree of T at v. For any \(k \ge 0\) we let \(f^{[k]}(T,v)\) denote the fringe subtree of the kth ancestor of v, marked at the vertex corresponding to v. (In the case \(k=0\), the kth ancestor of v is the vertex v itself, and the marked vertex of \(f^{[0]}(T,v)\) coincides with its root vertex.) If the kth ancestor of v does not exist, then we set \(f^{[k]}(T,v)\) to some placeholder value. We call \(f^{[k]}(T,v)\) an extended fringe subtree. See Fig. 1 for an illustration.
We may also consider locally finite \(\mathfrak {G}\)type plane trees with a marked vertex having a countably infinite number of ancestors. Such a plane tree has hence an infinite backwards growing spine and no root. See [2, 21] for related notions in the monotype setting. The notion of extended fringe subtrees extends naturally to this setting.
Let \(\mathfrak {X}_\mathrm {f}\) denote the collection of all finite marked \(\mathfrak {G}\)type trees. Let \(\mathfrak {X}\) denote the union of \(\mathfrak {X}_\mathrm {f}\) and the collection of all marked plane trees with an infinite spine such that all extended fringe subtrees are finite. We may endow \(\mathfrak {X}\) with a metric
Proposition 1
The space \((\mathfrak {X}, d_{\mathfrak {X}})\) is Polish and \(\mathfrak {X}_\mathrm {f} \subset \mathfrak {X}\) is a countable dense subset.
Proof
The space is complete: If \((T_n^\bullet )_{n \ge 1}\) is a Cauchy sequence in \((\mathfrak {X}, d_{\mathfrak {X}})\), then for each integer \(h \ge 1\) there is an integer \(N_h \ge 1\) such that for all \(n \ge N_h\) we have \(f^{[h]}(T_n^\bullet ) = f^{[h]}(T_{N_h}^\bullet )\). We may define a tree \(T^\bullet \in \mathfrak {X}\) such that \(f^{[h]}(T^\bullet ) = f^{[h]}(T_{N_h}^\bullet )\) for all \(h \ge 1\). This tree satisfies \(\lim _{n \rightarrow \infty } d_{\mathfrak {X}}(T^\bullet , T_n^\bullet ) =0\).
The space is separable and \(\mathfrak {X}_\mathrm {f}\) is a countable dense subset: There are countably many finite plane trees. As \(\mathfrak {G}\) is countable, each finite tree has a countable number of type configurations. Hence, there are countably many finite \(\mathfrak {G}\)type trees. Each has a finite number of locations for a marked vertex. Hence, \(\mathfrak {X}_\mathrm {f}\) is countable. Moreover, for any integer \(h \ge 0\) and any \(T^\bullet \in \mathfrak {X}\setminus \mathfrak {X}_{\mathrm {f}}\) it holds that \(f^{[h]}(T^\bullet ) \in \mathfrak {X}_\mathrm {f}\) and \(d_{\mathfrak {X}}(T^\bullet , f^{[h]}(T^\bullet )) = 2^{h}\). We may force this distance to be arbitrarily small by taking h sufficiently large.
\(\square \)
Annealed and Quenched Convergence of Random Trees
Suppose that \((\varvec{T}_n)_{n \ge 1}\) is a sequence of random finite \(\mathfrak {G}\)type plane trees. Let \(\mathfrak {G}_0 \subset \mathfrak {G}\) be a nonempty subset so that
as \(n \rightarrow \infty \). We may select a vertex \(v_n\) from \(\varvec{T}_n\) uniformly at random among all vertices of \(\varvec{T}_n\) whose type lies in \(\mathfrak {G}_0\). That is, if vertices of such types are present, otherwise we set \(v_n\) to some placeholder value.
Annealed convergence of \((\varvec{T}_n, v_n)\) refers to distributional convergence in the usual sense, that is
for some random variable \(\varvec{T}^\bullet \) with values in \(\mathfrak {X}\). This is equivalent to requiring
for any integer \(h \ge 0\) and any finite marked tree \(T^\bullet \in \mathfrak {X}_\mathrm {f}\).
Let \(\mathbb {M}_1(\mathfrak {X})\) denote the Polish space of Borel probability measures on \(\mathfrak {X}\). Given a finite \(\mathfrak {G}\)type tree T having at least one vertex with type in \(\mathfrak {G}_0\), we may consider the probability measure \(P_T \in \mathbb {M}_1(\mathfrak {X})\) that corresponds to the uniform measure on all pairs (T, v), with v a vertex of T having type in \(\mathfrak {G}_0\). Thus,
We say \((\varvec{T}_n,v_n)\) converges in the quenched sense to \(\varvec{T}^\bullet \), if
This is equivalent to requiring that for any integer \(h \ge 0\) and any finite marked tree \(T^\bullet \in \mathfrak {X}_\mathrm {f}\), with the marked vertex having type in \(\mathfrak {G}_0\), it holds that
Rerooted Multitype Galton–Watson Trees
Let \(\mathfrak {G}\) denote a countable nonempty set of types. Let \(\varvec{\sigma } = (\varvec{\sigma }_i)_{i \in \mathfrak {G}}\) denote an independent family with \(\varvec{\sigma }_i\) a random word from \(\langle \mathfrak {G} \rangle \) for each type \(i \in \mathfrak {G}\). We let \(\varvec{\xi }_i\) denote the random vector corresponding to \(\varvec{\sigma }_i\). That is, \(\varvec{\xi }_i\) takes values in \(\mathbb {N}_0^{( \mathfrak {G} )}\), and for each \(j \in \mathfrak {G}\) the jth coordinate of \(\varvec{\xi }_i\) is equal to the number of occurrences of the letter j in the random word \(\varvec{\sigma }_i\). Let \(\varvec{\xi } = (\varvec{\xi }_i)_{i \in \mathfrak {G}}\). By abuse of notation, we call \(\varvec{\sigma }\) an ordered \(\mathfrak {G}\)type offspring distribution, and \(\varvec{\xi }\) the associated (unordered) \(\mathfrak {G}\)type offspring distribution.
A \(\mathfrak {G}\)type branching process with offspring distribution \(\varvec{\sigma }\) starts with a single individual whose type is determined by an independent random variable \(\alpha \) with values in \(\mathfrak {G}\). Any individual of type \(i \in \mathfrak {G}\) receives offspring according to an independent copy of \(\varvec{\sigma }_i\), with the jth coordinate of the copy corresponding to the number of children with type j.
We let \(\varvec{T}\) denote the \(\mathfrak {G}\)type plane tree that encodes the genealogical structure of the \(\mathfrak {G}\)type branching process, and say \(\varvec{T}\) is a \(\varvec{\sigma }\)Galton–Watson tree.
We will always make the assumption that
We may do so without loss of generality, since we may shrink the set \(\mathfrak {G}\) to exclude irrelevant types. Furthermore, we only consider offspring distributions for which
See for example [3, Thm. 2 on page 186] for conditions ensuring this.
Fringe Subtrees
Let us fix a type \(\kappa \in \mathfrak {G}\). We let \(\varvec{T}^{\alpha }\) denote a random multitype tree defined similarly to \(\varvec{T}\) (with the root type determined according to an \(\alpha \)distributed choice), only that nonroot vertices of type \(\kappa \) receive no offspring. This way, \(\varvec{T}\) may be generated by starting with \(\varvec{T}^{\alpha }\) and inserting at each nonroot vertex of type \(\kappa \) an independent copy of \(\varvec{T}\) conditioned on having root type \(\kappa \). We let \(\varvec{T}^{\kappa }\) be defined analogously to \(\varvec{T}^\alpha \), but we start with a root having a fixed type \(\kappa \). Moreover, we let \(\varvec{T}^\kappa _1, \varvec{T}^\kappa _2, \ldots \) denote independent copies of \(\varvec{T}^{\kappa }\). Assumption (12) entails that
It follows by the standard depthfirstsearch exploration that the multitype Galton–Watson tree \(\varvec{T}\) may be constructed from a sequence
with \(L\ge 0\) the smallest nonnegative integer for which
In particular,
Let T be a finite \(\mathfrak {G}\)type tree whose root has type \(\kappa \). We may decompose T in the same way, so that it corresponds to a sequence of trees \((T_1, \ldots , T_k)\). We let \(N_T(\cdot )\) denote a function that takes a finite \(\mathfrak {G}\)type tree as input and returns the number of occurrences of T as a fringe subtree. We let \(\psi (\cdot )\) denote a function that takes as input a finite ordered sequence of \(\mathfrak {G}\)type trees and returns as output the number of occurrences of \((T_1, \ldots , T_k)\) as a consecutive substring. Generating \(\varvec{T}\) from the sequence in (14), we may write
Note that occurrences of \((T_1, \ldots , T_k)\) may not overlap: since \((T_1, \ldots , T_k)\) corresponds to a tree, no proper initial segment \((T_1, \ldots , T_i)\) with \(1 \le i < k\) may be equal to a proper tail segment \((T_{ki+1}, \ldots , T_k)\). Hence, changing one coordinate of the input of the function \(\psi \) changes its value by at most 1.^{Footnote 2} It follows by McDiarmid’s inequality that for any integer \(\ell \ge 1\)
Moreover,
with the O(1) term having a deterministic absolute bound that depends only on T. Letting \(\varvec{T}(\kappa )\) denote a \(\varvec{\sigma }\)Galton–Watson tree started at a vertex with type \(\kappa \), it holds that
Lemma 1
We consider the conditioned multitype Galton–Watson tree
for some family of events \(\mathcal {E}_n\) satisfying \(\mathbb {P}(\mathcal {E}_n)>0\) for all n. Suppose that there is a deterministic sequence \(s_n\rightarrow \infty \) satisfying for all \(\epsilon >0\)
Then for any finite \(\mathfrak {G}\)type tree T with root type \(\kappa \)
Let \(f(\varvec{T}_n, v_n^\kappa )\) denote the fringe subtree in \(\varvec{T}_n\) encountered at a uniformly selected type \(\kappa \) vertex \(v_n^\kappa \) of \(\varvec{T}_n\). Then
Here we interpret the conditional law \(\mathfrak {L}(f(\varvec{T}_n, v_n^\kappa ) \mid \varvec{T}_n)\) as a random Borel probability measure on the countable space of finite \(\mathfrak {G}\)type plane trees equipped with the discrete topology.
Proof of Lemma 1
Using Eqs. (16) and (17), we obtain for any \(\epsilon >0\)
Combining Eqs. (18), (19), and (20), it follows that there is a constant \(C>0\) that only depends on T, such that for \(\ell \ge s_n  1\) and n large enough (so that \(\epsilon \ell >C\))
Summing up, we obtain
Our assumptions in (22) ensure that the upper bound in Inequality (25) tends to zero as n becomes large. Hence, this verifies (23).
We have verified (23) for arbitrary finite T, and Assumptions (11) and (12) ensure that \(\varvec{T}(\kappa )\) is almost surely finite. Hence, the convergence of random probability measures in (24) follows. \(\square \)
Of course, periodicities may come into play, and it is sensible to also consider events \(\mathcal {E}_n\) for which \(\mathbb {P}(\mathcal {E}_n)>0\) only when n is part of some infinite subset of \(\mathbb {N}_0\). Nothing changes in our arguments as long as we restrict n to that subset when taking limits.
Lemma 1 is rather general. Under stronger assumptions, its proof yields stronger results:
Remark 1
We may apply Lemma 1 if
and if there is a concentration constant \(c(\kappa )>0\) such that \(\mathbb {P}(\#_\kappa \varvec{T}_n \notin (1 \pm \epsilon )c(\kappa )n)\) tends to zero exponentially fast for any fixed \(\epsilon >0\). Using (25) it follows that
for some constant \(0< \gamma (\epsilon ) <1\). Hence, by the Borel–Cantelli criterium
yielding
Multitype Sintrees with a Fixed Root Type
We are going to define a random infinite but locally finite multitype tree \(\hat{\varvec{T}}(\kappa )\) having an infinite spine that growth backwards.
Note that \(\#_\kappa \varvec{T}(\kappa )\) is distributed like the population of a monotype Galton–Watson tree with branching mechanism \(\#_\kappa \varvec{T}^\kappa 1\). Assumptions (11) and (12) entail that
This means
The construction requires us to make the assumption that the \(\kappa \)branching mechanism is actually critical. That is, we assume in the following that
This allows us to define the \(\kappa \)biased version \(\hat{\varvec{T}}^\kappa \) of \(\varvec{T}^\kappa \) with distribution given by
for any pair \((T^\kappa , u)\) of a \(\mathfrak {G}\)type tree \(T^\kappa \) (with the root having type \(\kappa \) and all nonroot vertices of type \(\kappa \) having no offspring) and a vertex u of \(T^\kappa \) that is a nonroot vertex of type \(\kappa \). Note that Assumption (32) is really required in order for this to be a probability distribution.
We are now ready to construct the random infinite \(\mathfrak {G}\)type tree \(\hat{\varvec{T}}(\kappa )\). We start with a vertex \(u_0\) of type \(\kappa \) that is declared the start of the spine and becomes the root of an independent copy of \(\varvec{T}(\kappa )\). The ancestor \(u_1\) of \(u_0\) becomes the root of an independent copy of \(\hat{\varvec{T}}^\kappa \). We then glue the marked vertex to \(u_0\), and all nonmarked leaves of type \(\kappa \) become roots of independent copies of \(\varvec{T}(\kappa )\). We proceed in this way with an ancestor \(u_2\) of \(u_1\) and so on, yielding an infinite backwards growing spine \(u_0, u_1, \ldots \). That is, the tree \(\hat{\varvec{T}}(\kappa )\) obtained in this way has a marked vertex \(u_0\) with a countably infinite number of ancestors. This constitutes the multitype analogue of Aldous’ invariant sintree constructed in [2] for critical monotype Galton–Watson trees. Here the abbreviation sin stands for single infinite path.
Given an integer \(h \ge 0\), we let \(f^{\kappa , [h]}(\cdot , \cdot )\) denote a function that takes as input a \(\mathfrak {G}\)type tree \(T_1\) together with one of its vertices \(v_1\), and returns the fringe subtree of \(T_1\) at the hth ancestor of type \(\kappa \) of \(v_1\) together with the location \(v_1\) within it. That is, it produces a marked tree where the root has type \(\kappa \) and where the path from the root to the marked vertex contains precisely \(h+1\) vertices of type \(\kappa \). If no such ancestor exists, the function returns \((T_1, v_1)\) together with the information that an overflow occurred. It is immediate that
and, in general, \(f^{\kappa , [h]}(\hat{\varvec{T}}(\kappa ))\) follows the distribution of \(\varvec{T}(\kappa )\) biased on the number vertices with type \(\kappa \) whose joining path with the root contains precisely \(h+1\) vertices that also have type \(\kappa \). That is, if T is a \(\mathfrak {G}\)type tree whose root has type \(\kappa \) and if u is a vertex of T of type \(\kappa \) such that the joining path with the root contains precisely \(h+1\) vertices of type \(\kappa \), then
Let T denote a finite \(\mathfrak {G}\)type tree and let v be a vertex of T, such that there are \(h+1\) vertices of type \(\kappa \) on the path from v to the root of T. Given a \(\mathfrak {G}\)type tree \(T_1\), we let \(N_{(T,v)}(T_1) \in \mathbb {N}_0 \cup \{\infty \}\) denote the number of vertices in \(T_1\) with \(f^{\kappa , [h]}(T_1,u) = (T,v)\) (without any overflow). It is obvious that the functions \(N_{(T,v)}(\cdot )\) and \(N_T(\cdot )\) always return the same number, hence
Together with Lemma 1 and Eq. (35) we obtain:
Theorem 1
Let \(\varvec{T}_n\) be as in Eq. (21). Suppose that \(\mathbb {E}[\#_\kappa \varvec{T}^\kappa ] = 2\) and that Assumption (22) holds. Let \(v_n^\kappa \) denote a uniformly selected type \(\kappa \) vertex of \(\varvec{T}_n\). Then
That is, given a finite \(\mathfrak {G}\)type tree T with root type \(\kappa \) and a type \(\kappa \) vertex v of T,
with \(h+1\) denoting the number of vertices of type \(\kappa \) on the path from the root to v in T.
Nonrecurring Types Along the Spine
Theorem 1 is a local convergence result for the vicinity of a uniformly selected vertex of type \(\kappa \) satisfying the criticality constraint (32). The limit tree \(\hat{\varvec{T}}(\kappa )\) has the property, that its spine has an infinite number of vertices of type \(\kappa \). We are going to prove a criterion that also encompasses types that occur only a stochastically bounded number of times along the spine of the limit.
Suppose that we are given a type \(\gamma \in \mathfrak {G} \setminus \{\kappa \}\) satisfying
This allows us to define the sizebiased version \(\hat{\varvec{T}}^{\kappa ,\gamma }\) given by
for any finite \(\mathfrak {G}\)type tree T (with root type \(\kappa \), and all nonroot vertices of type \(\kappa \) having no offspring) and any vertex u of T of type \(\gamma \). We define \(\hat{\varvec{T}}(\kappa , \gamma )\) like \(\hat{\varvec{T}}(\kappa )\), only with a single local modification: instead of letting \(u_0\) become the root of an independent copy of \(\varvec{T}(\kappa )\), we let it become the root of an independent copy of \(\hat{\varvec{T}}^{\kappa ,\gamma }\) (with the marked vertex becoming the marked vertex of \(\hat{\varvec{T}}(\kappa , \gamma )\)), and then make each of the type \(\kappa \) leaves of this structure the root of an independent copy of \(\varvec{T}(\kappa )\). Note that \(\hat{\varvec{T}}(\kappa , \gamma )\) may or may not have an infinite number of vertices of type \(\gamma \) on the spine, depending on whether \(\varvec{T}^{\kappa }\) has with positive probability a vertex of type \(\gamma \) on the path from the root of \(\varvec{T}^\kappa \) to some leaf of \(\varvec{T}^{\kappa }\) with type \(\kappa \).
The representation (14) entails that, since \(\gamma \ne \kappa \),
Hence, if the events \(\mathcal {E}_n\) are reasonably well behaved, Assumption (39) and Eq. (41) will ensure that \(\#_\gamma \varvec{T}\) concentrates around \(\mathbb {E}[\#_\gamma \varvec{T}^\kappa ] \#_\kappa \varvec{T}\). This motivates the following local convergence result for the vicinity of a typical vertex with type \(\gamma \):
Theorem 2
Let \(\varvec{T}_n\) be as in Eq. (21). Suppose that \(\mathbb {E}[\#_\kappa \varvec{T}^\kappa ] = 2\) and that Assumption (22) holds. Furthermore, assume that \(0< \mathbb {E}[\#_\gamma \varvec{T}^\kappa ]< \infty \). Then for any finite \(\mathfrak {G}\)type tree T with root type \(\kappa \) and a type \(\gamma \) vertex v of T it holds that
with \(h+1\) denoting the number of vertices of type \(\kappa \) on the path from the root to v in T. Let \(v_n^\gamma \) denote a uniformly selected type \(\gamma \) vertex of \(\varvec{T}_n\). If
then
Proof
Equation (42) readily follows from (23), (36), and the definition of \(\hat{\varvec{T}}(\kappa , \gamma )\). Having Eq. (42) and Assumption (43) at hand, (44) readily follows by Slutsky’s theorem. \(\square \)
Remark 2
Note that Theorem 2 also applies to the case \(\gamma = \kappa \) if we replace \(\mathbb {E}[\#_\gamma \varvec{T}^\kappa ]\) by 1 in the definition of \(\hat{\varvec{T}}(\kappa , \gamma )\) and in Assumption (43).
Proposition 2
Theorem 2 still holds if we relax Eq. (43) to
Proof
Let (T, v) be an arbitrary pointed tree where T has root type \(\kappa \) and v has type \(\gamma \) and height \(h\ge 0\). If \(\mathbb {P}(f^{\kappa , [h]}(\hat{\varvec{T}}(\kappa , \gamma )) = (T,v))=0\), then \(N_{(T,v)}(\varvec{T}_n)=0\) for all n, hence it suffices to verify
for the cases where \( \mathbb {P}(f^{\kappa , [h]}(\hat{\varvec{T}}(\kappa , \gamma )) = (T,v))>0\). Let \(\varOmega \) denote the collection of all such (T, v). Equations (45) and (42) imply that
That is, for any \(\epsilon >0\) it holds with high probability that
Suppose that there exists \((T_0, v_0) \in \varOmega \) and \(\epsilon _0, \delta _0>0\) and a subsequence \((n_k)_k\) with
for all n in that subsequence. Letting \(\varOmega ' \subset \varOmega \) denote a finite subset with \(\mathbb {P}(f^{\kappa , [h]}(\hat{\varvec{T}}(\kappa , \gamma )) \in \varOmega '))>1\epsilon \) and \((T_0,v_0) \in \varOmega '\), it follows that with probability at least \(\delta _0 + o(1)\) for all n in that subsequence
Taking \(\epsilon \) small enough, this yields a contradiction. This verifies (46) for all \((T,v) \in \varOmega \) and completes the proof. \(\square \)
Mixtures of Types
Lemma 2 gives a criterium for local convergence describing the vicinity of random vertices with a fixed type. We aim to prove limits for the conditioned tree \(\varvec{T}_n\) describing the local structure near a specified vertex that may have different types.
Given an integer \(h \ge 0\), we let \(f^{[h]}(\cdot , \cdot )\) denote a function that takes as input a \(\mathfrak {G}\)type tree together with one of its vertices, and returns the fringe subtree at the hth ancestor of that vertex together with the location of the vertex within it (yielding a marked tree where the root and the marked vertex have distance h from each other). If no such ancestor exists, the function returns the marked tree together with the information, that an overflow occurred.
The following observation follows directly from Theorem 2 and Remark 2.
Theorem 3
Let \(\varvec{T}_n\) be as in Eq. (21). Suppose that \(\mathbb {E}[\#_\kappa \varvec{T}^\kappa ] = 2\) and that Assumption (22) holds. Let \(\mathfrak {G}_0 \subset \mathfrak {G}\) be a nonempty subset such that
for each \(\gamma \in \mathfrak {G}_0\setminus \{\kappa \}\). Let \(v_n\) be a vertex of \(\varvec{T}_n\) drawn uniformly at random from all vertices with type in \(\mathfrak {G}_0\). We set \(p(\gamma ) = \mathbb {E}[\#_\gamma \varvec{T}^\kappa ]\) for \(\gamma \in \mathfrak {G}_0\setminus \{\kappa \}\), and \(p(\kappa ) =1\) in case \(\kappa \in \mathfrak {G}_0\). If
then
for an independent random type \(\eta \) from \(\mathfrak {G}_0\), with distribution given by
Note that if \(\mathfrak {G}_0\) is finite, then (50) readily follows from (49). We provide an application of Theorem 3 to critical sesquitype trees in Sect. 4.2 and to critical irreducible Galton–Watson trees in Sect. 4.4
Note that using Theorem 1 we may still establish local convergence if the proportion of vertices of a certain type concentrates at different values as in Eq. (49), but this works only for types that recur infinitely often on the spine in the limit.
Applications
We are going to illustrate the general results of the previous section by some examples.
Lattices and the Gnedenko Local Limit Theorem
Before we start, let us discuss a few relevant concepts. Given an integer \(d \ge 1\), a lattice in \(\mathbb {Z}^d\) is a subset of the form
for \(\varvec{a} \in \mathbb {Z}^d\) and \(\varvec{A} \in \mathbb {Z}^{d \times d}\). For any \(\varvec{b} \in L_{\varvec{a}, \varvec{A}}\) it holds that \(L_{\varvec{a}, \varvec{A}} = L_{\varvec{b}, \varvec{A}}\). In particular, if we shift a lattice by the negative of any of its elements, we obtain a \(\mathbb {Z}\)linear submodule of \(\mathbb {Z}^d\). Note that the matrix \(\varvec{A}\) is not uniquely determined by the lattice. Any matrix whose columns form a \(\mathbb {Z}\)linear generating set of \(\{\varvec{A} \varvec{x} \mid \varvec{x} \in \mathbb {Z}^d\}\) will do.
Given a nonempty subset \(\varOmega \subset \mathbb {Z}^d\) there is smallest lattice in \(\mathbb {Z}^d\) containing \(\varOmega \): We may select \(\varvec{a} \in \varOmega \) and let \(\varLambda \) denote the \(\mathbb {Z}\)span of \(\varOmega  \varvec{a}\). Any \(\mathbb {Z}\)submodule of \(\mathbb {Z}^d\) has rank at most d, hence there is at least one matrix \(\varvec{A} \in \mathbb {Z}^{d \times d}\) with \(\varLambda = \{\varvec{A} \varvec{x} \mid \varvec{x} \in \mathbb {Z}^d\}\). Hence, \(L_{\varvec{a}, \varvec{A}}\) is a lattice containing \(\varOmega \). Moreover, \(L_{\varvec{a}, \varvec{A}}\) is a subset of any lattice containing \(\varOmega \): If \(S = L_{\varvec{b}, \varvec{B}}\) is another lattice containing \(\varOmega \), then \(\varvec{a} \in S\) and consequently \(S = L_{\varvec{a}, \varvec{B}}\). This entails that the \(\mathbb {Z}\)module \(S  \varvec{a}\) must contain \(\varOmega  \varvec{a}\), and therefore \(\varLambda \) is a submodule of \(S  \varvec{a}\). Hence, \(L_{\varvec{a}, \varvec{A}} \subset S\).
We say a random vector \(\varvec{X}\) with values in an abelian group \(F \simeq \mathbb {Z}^d\) is aperiodic, if the smallest subgroup \(F_0\) of F that contains the support \(\mathrm {supp}(\varvec{X})\) satisfies \(F_0 = F\). Note that this not really a restriction, since the structure theorem for finitely generated modules over a principal ideal domain ensures that \(F_0 \simeq \mathbb {Z}^{d'}\) for some \(0 \le d' \le d\). We say \(\varvec{X}\) (and the associated random walk with step distribution \(\varvec{X}\)) is strongly aperiodic, if the smallest semigroup (a subset closed under addition that contains \(\varvec{0}\)) \(F_1\) of F that contains \(\mathrm {supp}(\varvec{X})\) satisfies \(F_1 = F\). This is an actual restriction. For example, if \(\varvec{X}\) is 2dimensional with support \(\{ (1,0), (0,1), (1,2) \}\), then it is aperiodic, but not strongly aperiodic (although the support is not even contained on any straight line).
Proposition 3
([30, Prop. 1]) Let \(\varvec{X}\) be a random vector in \(\mathbb {Z}^d\). Let \(\varvec{a} + \varvec{D} \mathbb {Z}^d\) be the smallest lattice containing the support of \(\varvec{X}\). Suppose that \(\varvec{a} \in \mathrm {supp}(\varvec{X})\) and that \(\varvec{D}\) has full rank, so that \(m := \det \varvec{D}\) is a positive integer. Let \((\varvec{X}_i)_{i \ge 1}\) denote independent copies of \(\varvec{X}\) and set
Then:

1.
The support of \(\varvec{S}_m\) generates \(\varvec{D} \mathbb {Z}^d\) as additive group.

2.
For all \(k \ge 1\) and \(1 \le j \le m\) it holds that \(\mathbb {P}(\varvec{S}_{km +j} \in j \varvec{a} + \varvec{D} \mathbb {Z}^d) = 1\).
The following is a strengthened and generalized multidimensional version of Gnedenko’s local limit theorem, that applies to the case of lattice distributed random variables that are aperiodic but not necessarily strongly aperiodic.
Proposition 4
(Strengthened local central limit theorem for lattice distributions) Let \(\varvec{X}\), m, \(\varvec{a}\), \(\varvec{D}\) and \(\varvec{S}_n\) be as in Proposition 3. Suppose that \(\varvec{X}\) has a finite covariance matrix \(\varvec{\varSigma }\). Our assumptions imply that \(\varvec{\varSigma }\) is positivedefinite. Let
be the density of the normal distribution \(\mathcal {N}(\varvec{0}, \varvec{\varSigma })\). Set
so that \(B_n^{1}(\varvec{S}_n  \varvec{a}_n) \,{\buildrel d \over \longrightarrow }\,\mathcal {N}(\varvec{0}, \varvec{\varSigma })\). Set
Then for each integer \(1 \le j \le m\)
The onedimensional local limit theorem by [8] was generalized by [16] to the lattice case of strongly aperiodic multidimensional random walk. This was further generalized by [30, Prop. 2] to the setting considered here, where \(\varvec{X}\) is aperiodic but not necessarily strongly aperiodic. Furthermore, the version stated in Proposition 4 is strengthened by the factor \(R_n(\varvec{x}) \) in Eq. (54). This is stronger than the original statement when \(\varvec{x}\) deviates sufficiently from \(\mathbb {E}[\varvec{S}_n]\). Such a strengthening was obtained by [17, Statement P10, page 79] for the strongly aperiodic case by modifying the proof. This strengthened version in the strongly aperiodic setting may be generalized to Proposition 4 analogously as in [30].
Sesquitype Trees
We start with the simplest model of a nonmonotype branching type process which already has interesting applications. Consider a 2type branching tree \(\varvec{T}\) where only vertices of the first type are fertile and receive offspring according to an ordered branching mechanism \(\varvec{\sigma }_1\). We let \(\varvec{\xi }_1 = (\xi , \zeta )\) denote the corresponding vector counting the number of occurrences of type 1 and type 2 vertices in the random word \(\varvec{\sigma }_1\). Of course we only consider the case where the root of \(\varvec{T}\) is fertile.
In order to avoid degenerate cases we assume that
As the monotype case is already wellunderstood, we additionally assume that the support
of \(\varvec{\xi }_1\) is not contained on a straight line, that is
If the support of \(\varvec{\xi }_1\) is contained in a straight line we can reduce every question about \(\varvec{T}\) to the study of a monotype \(\xi \)Galton–Watson tree. Hence, this is not much of a restriction.
We consider the tree \(\varvec{T}_n\) obtained by conditioning \(\varvec{T}\) on having n vertices in total. We would like to establish a limit describing the vicinity of a uniformly at random selected vertex \(v_n\). Due to possible periodicities, n may need to be restricted so some infinite subset of the positive integers in order for this to make sense:
Lemma 2
Let \(\mathrm {supp}(\#\varvec{T}) \subset \mathbb {N}\) denote the support of the number of vertices of the tree \(\varvec{T}\). Setting
it holds that \(\mathrm {supp}(\#\varvec{T}) \subset a + D \mathbb {N}\). Conversely, for all sufficiently large integers \(n \in a + D \mathbb {N}\)
Proof
It is clear by construction that \(\mathrm {supp}(\#\varvec{T}) \subset a + D \mathbb {N}\). The difficult and important part is the converse direction. The generating series \(Z(z) := \mathbb {E}[z^{\#\varvec{T}}]\) satisfies the recursion
with \(f(x,y) := \mathbb {E}[x^{\xi } y^{\zeta }]\). We may rewrite this as
for power series \((E_k(z))_{k \ge 0}\) with nonnegative coefficients uniquely determined by \( zf(y,z) = \sum _{k \ge 0} E_k(z) y^k\). Let \(F_k\) denote the collection of integers i such that the coefficient of the monomial \(z^i\) in \(E_k(z)\) is positive. We are going to use the commutative operation
for subsets \(I, J \subset \mathbb {Z}\), and set \(k + J := \{k\} + J\) for any integer k. Note that by definition \(I + \emptyset = \emptyset \). It was shown by [4, Lem. 25] that
for
Note that \(S_k = \emptyset \) whenever \(F_k = \emptyset \). Moreover, note that
for all \(k \ge 0\) and \(b \in F_k\). We are going to argue that
It is clear that \(D \mid S_k\) for all \(k \ge 0\) by (62), so clearly D divides the righthand side of Eq. (65). Conversely, let r be a divisor of the righthand side of this Equation. As \(0 \in S_0\) it follows that \(r \mid S_k\) for all \(k \ge 1\). Moreover, we assumed that there exists \(k \ge 2\) with \(\mathbb {P}(\xi =k)>0\), implying \(S_k \ne \emptyset \). As \(r \mid S_k + S_0\) and \(r \mid S_k \ne \emptyset \) it follows that \(r \mid S_0\). Hence, \(r \mid S_k\) for all \(k \ge 0\) and hence, by Eq. (62), \(r \mid D\). This completes the verification of Eq. (65).
It follows by Schur’s theorem, stated in [29, Thm. 3.24], that there exists \(M \ge 1\) such that for all \(m \ge M\)
That is, mD may be expressed as a finite sum of terms of the form \(\lambda t\) with \(t \in S_1\), \(\lambda \in \mathbb {N}\), and terms of the form \(\mu (s + r)\) with \(s \in S_k\) for some \(k \ge 2\), \(r \in S_0\), and \(\mu \in \mathbb {N}\). We are going to argue that there is a tree T with \(a + Dm\) vertices that satisfies
To this end, note that
We start the growth construction of T with a single root vertex that we declare as marked. We iterate over the finitely many terms in the sum expression of mD, and each step takes as input a tree with a single marked leaf and outputs a bigger tree with a single marked leaf:

1.
If the summand is of the form \(\lambda t\) with \(\lambda \in \mathbb {N}\) and \(t \in S_1\), then the marked leaf receives \(t1\) type 2 offspring vertices and a single type 1 offspring vertex that becomes the new marked leaf. Note that the outdegree \((1,t1)\) lies in the support of \(\varvec{\xi }_1\) by Eq. (64). We do this precisely \(\lambda \) many times. Hence in total we added \(\lambda t\) vertices.

2.
If the summand is of the form \(\mu (r + s)\) with \(\mu \in \mathbb {N}\), \(r \in S_k\) for some \(k \ge 1\) and \(s \in S_0\), we do the following. By Eq. (63) there is \(b \in F_k\) and \(c \in F_0\) such that
$$\begin{aligned} r + s&= (k1)a + b a + c \\&= (k2)(a1) + (c1) + k + (b1). \end{aligned}$$The marked leaf receives mixed offspring according to \((k, b1)\). The first offspring of type 1 becomes the new marked leaf. The second offspring of type 1 receives offspring \((0, c1)\). The remaining \(k2\) offspring vertices of type 1 each receive offspring \((0,a1)\). Note that by Eq. (64) all nonmarked vertices have an outdegree that lies in the support of \(\varvec{\xi }_1\). We perform this precisely \(\mu \) many times. Hence in total we added \(\mu (r+s)\) vertices.
After iterating over all summands we are left with a tree having \(1 + mD\) vertices (remember that we also have to count the root vertex) that has a marked leaf. All nonmarked vertices have an outdegree that lies in the support of \(\varvec{\xi }_1\). The marked vertex receives offspring \((0, a1)\), resulting in a tree T with \(a + mD\) vertices that satisfies (66). As we may perform this construction for all \(m \ge M\) this completes the proof. \(\square \)
Setting \(\kappa =1\), the tree \(\varvec{T}^\kappa \) consists of a root of type 1 with offspring according to \(\varvec{\xi }_1\) and no further descendants. Hence in order to apply Theorem 3 we need to assume that
It holds trivially that \(\# \varvec{T} \ge \#_1 \varvec{T}\), and \(\#_1 \varvec{T}\) is distributed like the total progeny of a \(\xi \)Galton–Watson process. As we assume that \(\mathbb {E}[\xi ]=1\), it follows that \(\mathbb {P}(\#_1 \varvec{T} = n) = \exp (o(n))\) (see [10, Thm. 18.1]) and consequently:
Hence, the only prerequisite that we still need to check in order to apply Theorem 3 is that
Indeed, if (70) is verified, then (22) holds for \(s_n := cn\) for some fixed constant \(0<c<1/(1  \mathbb {E}[\zeta ])\). Furthermore, (70) and \(\#\varvec{T} = \#_1\varvec{T} + \#_2\varvec{T}\) imply \( \frac{ \#_2 \varvec{T}_n }{n} \,{\buildrel p \over \longrightarrow }\,\frac{\mathbb {E}[\zeta ]}{1 + \mathbb {E}[\zeta ]}\) and hence \(\frac{\#_2 \varvec{T}_n}{\#_1 \varvec{T}_n} \,{\buildrel p \over \longrightarrow }\,\mathbb {E}[\zeta ]\), thus verifying (49) for \(\gamma :=2\).
We verify Eq. (70) in the case that \((\xi , \zeta )\) has a finite covariance matrix \(\varvec{\varSigma }\). The following is an extension of [19, Lem. 22], where a combinatorial setting was considered that is related to the case where one additionally assumes that \(a=1\) and that \((\xi , \zeta )\) has finite exponential moments.
Lemma 3
Assume that \(\mathbb {P}(\xi =0)>0\), \(\mathbb {P}(\xi \ge 2)>0\), and that the support of \((\xi , \zeta )\) is not contained on a straight line. Suppose that \(\mathbb {E}[\xi ]=1\) and that \((\xi , \zeta )\) has a finite covariance matrix \(\varvec{\varSigma }\). Let \(a, D \ge 1\) be defined as in Eq. (58).

1.
There is a rank 2 matrix \(\varvec{D} \in \mathbb {Z}^{2 \times 2}\) such that the support of \((\xi , \zeta )^\intercal \) is contained in the lattice \((0, a1)^\intercal + \varvec{D}\mathbb {Z}^2\) and in no proper sublattice. It holds that
$$\begin{aligned} \mathfrak {d} := \frac{\det \varvec{D}}{D} \in \mathbb {N}. \end{aligned}$$(71) 
2.
As \(n \in a + D \mathbb {Z}\) tends to infinity, we have
$$\begin{aligned} \mathbb {P}(\# \varvec{T} = n) \sim D \sqrt{\frac{1 + \mathbb {E}[\zeta ]}{2 \pi \mathbb {V}[\xi ]}} n^{3/2}. \end{aligned}$$(72) 
3.
Set
$$\begin{aligned} \mu = \frac{1}{1 + \mathbb {E}[\zeta ]} \qquad \text {and} \qquad \sigma ^2 = \frac{\det \varvec{\varSigma }}{\mathbb {V}[\xi ](1 + \mathbb {E}[\zeta ])^3}. \end{aligned}$$(73)There is a sequence \((j_n)_n\) with values in \(\{1, \ldots , \mathfrak {d}\}\) with the following property. As \(n \in a + D \mathbb {Z}\) tends to infinity,
$$\begin{aligned} \sqrt{n} \mathbb {P}(\#_1\varvec{T} = \ell \mid \#\varvec{T} = n) = \frac{\mathfrak {d}}{\sigma \sqrt{2\pi }} \exp \left( \frac{x^2}{2 \sigma ^2}\right) + o(1) \end{aligned}$$(74)uniformly for all x satisfying
$$\begin{aligned} \ell := \mu n +x \sqrt{n} \in j_n + \mathfrak {d}\mathbb {Z}. \end{aligned}$$(75)The probability in (74) equals zero when \(\ell \notin j_n + \mathfrak {d}\mathbb {Z}\). Hence
$$\begin{aligned} \frac{(\#_1\varvec{T} \mid \#\varvec{T} = n)  n \mu }{\sqrt{n}} \,{\buildrel d \over \longrightarrow }\,\mathcal {N}(0, \sigma ^2). \end{aligned}$$(76)
Proof
We set
and let
denote independent copies of \(\varvec{X}\). We also set
Equations (15) and (16) tell us that for \(\ell \ge 1\)
with \((\xi _i,\zeta _i)_{i \ge 1}\) denoting independent copies of \((\xi , \zeta )\). By the cycle lemma (see for example [23]), this simplifies to
The support of \(\varvec{\xi }_1\) was assumed to be not contained in a straight line, hence the same goes for \((\xi 1, \zeta +1)\). Hence, the covariance matrix \(\varvec{\varSigma }\) (of both \(\varvec{\xi }_1\) and the shifted version \((\xi 1, \zeta +1)\)) is positive definite. Furthermore, there is a rank 2 matrix \(\varvec{D} \in \mathbb {Z}^2\) such that the support of \((\xi 1, \zeta +1)^\intercal \) is contained in the lattice \(\varvec{a} + \varvec{D}\mathbb {Z}^2\), with \(\varvec{a} := (1,a)^\intercal \), and in no proper sublattice. (Recall that \((0, a1)\) lies in the support of \(\varvec{\xi }_1\) by Eq. (67).) We set
Let \(n \in a + D \mathbb {Z}\) be sufficiently large so that \(\mathbb {P}(\#\varvec{T} = n)>0\) by Lemma 2. By Eq. (81) this means that for at least one \(1 \le \ell \le n\) it holds that \(\varvec{y}_n\) lies in the support of \(\varvec{S}_\ell \). By Proposition 3 it follows that there is at least one integer \(1 \le j_n \le m\) with
Note that for all \(j,j' \in \mathbb {Z}\) the following statements are equivalent:

1.
\((j \varvec{a} + \varvec{D} \mathbb {Z}^2) \cap (j' \varvec{a} + \varvec{D} \mathbb {Z}^2) \ne \emptyset \).

2.
\(\varvec{0} \in (jj')\varvec{a} + \varvec{D} \mathbb {Z}^2\).

3.
\((jj')\varvec{a} \in \varvec{D}\mathbb {Z}^2\).

4.
\(j \varvec{a} + \varvec{D} \mathbb {Z}^2 = j' \varvec{a} + \varvec{D} \mathbb {Z}^2\).
The set of all \(j \in \mathbb {Z}\) with \(j \varvec{a} \in \varvec{D} \mathbb {Z}^2\) is a subgroup of the integers. By Proposition 3 it contains m. Hence, it is generated by some integer \(\mathfrak {d} \ge 1\) satisfying
We will postpone showing that we assume that \(\mathfrak {d}\) may be chosen as in (71). Moreover, we have
Hence, from now on we may assume additionally that \(1 \le j_n \le \mathfrak {d}\). By Eq. (81) it follows that any integer \(\ell \ge 1\) with \(\mathbb {P}( \#\varvec{T} = n, \#_1\varvec{T} = \ell )>0\) must lie in the lattice \(j_n + \mathfrak {d} \mathbb {Z}\). It is clear that not the entire lattice has this property. However, we will argue that this is true for all \(\ell \in j_n + \mathfrak {d} \mathbb {Z}\) that concentrate in a \(\sqrt{n}\) range around \(\mu n\). Given \(\ell \in j_n + \mathfrak {d} \mathbb {Z}\) with \(\ell \ge 1\) we may write
Let \(M>0\) be a fixed constant. It holds uniformly for all \(\ell \) with \(x_\ell  < M\) that
Hence
It follows from the multivariate local limit theorem in Proposition 4 that
Let \(\varphi _{0, \sigma ^2}(\cdot )\) denote the density of the centered normal distribution with variance \(\sigma ^2\). By Eq. (81) it follows that
uniformly for \(x_\ell  <M\). Setting
this entails that for any fixed real numbers \(a_1<a_2\)
We are going to argue that for each \(\epsilon >0\) we may choose \(M>0\) so that for all sufficiently large n
To this end, suppose that \(1 \le \ell \le n\) satisfies \(\ell \in j_n + \mathfrak {d} \mathbb {Z}\) and \(x_\ell  \ge M\). The multivariate local limit theorem in Proposition 4 entails that there is a constant \(C>0\) that does not depend on \(\ell \) such that
Hence
If we restrict to summands with \(x_\ell  \ge n^{1/4 + \delta }\) for any fixed \(0<\delta <1/4\), we may be bound this by
If we restrict to summands with \(M \le x_\ell  \le n^{1/4 + \delta }\) instead, then \(\ell = \varTheta (n)\) and we obtain the bound
Taking M large enough, this bound is smaller than \(\epsilon /2\). This verifies Eq. (91).
Combining Eqs. (90) and (91) we obtain
Using (88) it follows that
uniformly for \(\ell \in j_n + \mathfrak {d} \mathbb {Z}\) with \(x_\ell  \le M\). Using (91), it follows that this remains true if we remove the condition that \(x_\ell \) needs to be bounded.
By (90) we obtain
It remains to show that the integer \(\mathfrak {d}\) (as defined in this proof) may be chosen as in (71). That is, we have to show that
Some jokes have been told about how mathematicians solve problems by reducing them to previously solved problems, even when it’s not the most direct solution. The following short but not necessarily direct justification of (99) might fit into this category. For any sufficiently large \(K>0\) there is a random variable \(\varvec{\xi }_1^{(K)} = (\xi ^{(K)}, \zeta ^{(K)})\) with support \(\mathrm {supp}(\varvec{\xi }_1^{(K)}) = \{ \varvec{x} \in \mathrm {supp}(\varvec{\xi }_1) \mid \Vert \varvec{x} \Vert _2 < K\}\) that satisfies \(\mathbb {E}[\xi ^{(K)}]=1\). Let \(\varvec{T}^{(K)}\) denote the sesquitype tree defined for \(\varvec{\xi }_1^{(K)}\) instead of \(\varvec{\xi }_1\). We assume that K is sufficiently large so that the support of \(\varvec{\xi }_1^{(K)}\) is not contained on a straight line. Lemma 2 and everything we have shown so far applies to \(\varvec{T}^{(K)}\), yielding an analogon \(D^{(K)}\) to D that satisfies \(D^{(K)}  D\), an analogon \(\varvec{D}^{(K)}\) to \(\varvec{D}\) that satisfies \( \varvec{D}^{(K)} \mathbb {Z}^2 \subset \varvec{D} \mathbb {Z}^2\), and an analogon \(\mathfrak {d}^{(K)}\) to \(\mathfrak {d}\) that satisfies \(\mathfrak {d}^{(K)}  \mathfrak {d}\). The construction of these constants implies that for K sufficiently large equality holds, meaning we have \(\mathfrak {d}^{(K)} = \mathfrak {d}\), \(D^{(K)} = D\), and may assume that \(\varvec{D} = \varvec{D}^{(K)}\). As \(\varvec{\xi }^{(K)}_1\) is bounded and hence has finite exponential moments, we may apply a singularity analysis result by [4, Thm. 28], yielding
as \(n \in a + D \mathbb {Z}\) tends to infinity. At the same time, Eq. (96) applied to \(\varvec{T}^{(K)}\) yields
It follows that
This completes the proof. \(\square \)
In the case that \((\xi , \zeta )\) has finite exponential moments, Eq. (72) may also be obtained using singularity analysis methods, see [4, Thm. 28]. Here we only assumed a finite covariance matrix.
Having assured the concentration of the proportion of types in Eq. (70), we readily obtain by Theorem 3:
Theorem 4
Under the same assumptions as in Lemma 3, it follows that
as \(n \in a + D \mathbb {N}\) tends to infinity. Here \(\eta \) denotes the independent Bernoullidistributed random type from \(\{1,2\}\) with distribution given by
See also [19, Thm. 27] for a similar result in the combinatorial setting of random unlabelled \(\mathcal {R}\)enriched trees where finite exponential moments were assumed.
Critical Reducible Galton–Watson Trees
Suppose that the type set is given by \(\mathfrak {G}= \{1, \ldots , d\}\) for some integer \(d \ge 2\). Let \(\varvec{\sigma }\) be an ordered dtype offspring distribution and \(\varvec{\xi } = (\varvec{\xi }_1, \ldots , \varvec{\xi }_d)\) the corresponding unordered offspring distribution with \(\varvec{\xi }_i = (\xi _{i,1}, \dots , \xi _{i,d})\) for all \(1 \le i \le d\). We assume that almost surely
That is, a particle of type i may only have offspring with types \(j \ge i\). We furthermore assume that \(\xi _{1,1}\) satisfies \(\mathbb {P}(\xi _{1,1}=0)>0\), \(\mathbb {P}(\xi _{1,1}\ge 2) >0\), and
Recall that for \(\kappa := 1\) the random tree \(\varvec{T}^1\) is distributed like the \(\varvec{\sigma }\)Galton–Watson tree \(\varvec{T}\), only that nonroot vertices of type 1 receive no offspring. We set
so that \(\xi + \zeta \) is the number of nonroot vertices of \(\varvec{T}^1\) and \(\xi \,{\buildrel d \over =}\,\xi _{1,1}\).
Let \(\varvec{S}\) denote a sesquitype tree started at a type 1 vertex, with vertices of the first type receiving offspring according to independent copies of \((\xi , \zeta )\), and vertices of the second type being infertile. It follows that
We let \(\varvec{T}_n\) denote the result of conditioning \(\varvec{T}\) on having n vertices. This is possible when \(n \in a + D \mathbb {Z}\) is large enough, with a and D defined for \((\xi , \zeta )\) as in Lemma 2. Equation (107) allows us to transfer properties of sesquitype trees:
Lemma 4
Suppose that additionally \((\xi ,\zeta )\) has a finite covariance matrix and that its support is not contained in a straight line. Then Lemma 3 holds analogously for the dtype reducible \(\varvec{\sigma }\)Galton–Watson tree \(\varvec{T}\), yielding an asymptotic expression for \(\mathbb {P}(\# \varvec{T} = n)\) and a local limit theorem for \(\#_1 \varvec{T}_n\).
In particular,
We may also verify concentration for the remaining types:
Lemma 5
Under the same assumptions as in Lemma 4, it follows that
for all types \(2 \le \gamma \le d\). Here we restrict n to lie in the lattice \(a + D \mathbb {Z}\).
Proof
Let \(\epsilon >0\) be given. Using the central limit theorem for \(\#_1 \varvec{T}_n\) from Lemma 4, we may select \(M>0\) large enough so that
for \(I_n := n/(1 + \mathbb {E}[\zeta ]) \pm M \sqrt{n}\) and all large enough n. Let \(\varvec{T}^{1}_1, \varvec{T}^{1}_2, \ldots \) denote independent copies of \(\varvec{T}^{1}\) and set for each \(i \ge 1\)
Let \(\delta >0\) be given and set \(J_n = (1 \pm \delta )\frac{\mathbb {E}[ \#_\gamma \varvec{T}^1]}{1 + \mathbb {E}[\zeta ]}n\). As \(\mathbb {P}(\# \varvec{T} =n) = \varTheta (n^{3/2})\), we may write
Arguing analogously as for (80) and (81), it follows that
Consider the collection
This way,
Clearly \(Q_n\) has at most n elements, and each vector \((1,a,b) \in Q_n\) satisfies
uniformly for \(\ell \in I_n\). Using the local limit theorem in Proposition 4 for 3 dimensions, it follows that
Combining Eqs. (112), (113), (115) and (117) it follows that
Using (110) and the fact that \(\epsilon >0\) was arbitrary, it follows that
\(\square \)
This allows us to apply Theorem 3, yielding:
Theorem 5
Let \(\mathfrak {G}_0 \subset \{1, \ldots , d\}\) denote a nonempty subset. Let \(v_n\) be uniformly selected among all vertices of \(\varvec{T}_n\) with type in \(\mathfrak {G}_0\). We set \(p(i) = \mathbb {E}[\#_i \varvec{T}^1]\) for \(i \in \mathfrak {G}_0\setminus \{1\}\), and \(p(1) =1\) in case \(1 \in \mathfrak {G}_0\). Under the same assumptions as in Lemma 4, it follows that
as \(n \in a + D \mathbb {N}\) tends to infinity. Here \(\eta \) denotes an independent random type from \(\mathfrak {G}_0\), with distribution given by
Regular Critical Irreducible Galton–Watson Trees
Suppose that the type set \(\mathfrak {G}= \{1, \ldots , d\}\) is finite. Suppose that the ordered offspring distribution \(\varvec{\sigma }\) corresponds to the unordered offspring distribution \(\varvec{\xi } = (\varvec{\xi }_i)_{1 \le i \le d}\) with \(\varvec{\xi }_i = (\xi _{i,1}, \ldots , \xi _{i,d})\) for all \(1 \le i \le d\). The mean matrix \( \varvec{A} := (\mathbb {E}[\xi _{i,j}])_{1 \le i,j \le d} \) is said to be finite, if each coordinate is finite. We say \(\varvec{\xi }\) and the associated branching process is irreducible, if for any types i, j there is an integer \(k \ge 1\) such that the (i, j)th entry of \(\varvec{A}^k\) is positive. The Perron–Frobenius theorem ensures that in this case the spectral radius \(\lambda \) of \(\varvec{A}\) is also an eigenvalue. If \(\lambda =1\) (or \(<1\) or \(>1\)), we say \(\varvec{\xi }\) / \(\varvec{\sigma }\) and the associated branching process is critical (or subcritical or supercritical). By [3, Thm. 2 on page 186], a \(\varvec{\sigma }\)Galton–Watson tree \(\varvec{T}\) is almost surely finite (regardless with which type we start) if its critical or subcritical. If \(\varvec{\xi }\) is critical and has finite exponential moments, we say it is regular critical.
Let \(\varvec{\omega } = (\omega _i)_{1 \le i \le d} \in \mathbb {N}_{0}^d \setminus \{\varvec{0}\}\) be fixed. Given a type \(1 \le \kappa \le d\) we are interested in the tree \(\varvec{T}_n\) obtained by conditioning the tree \(\varvec{T}\) started with a deterministic root type \(\kappa \) on the event that
It was shown by [18, Prop. 2.2] that there is an integer \(D \ge 1\) such that \(\varvec{T}_{\varvec{\omega }}\) is contained in some lattice of the form \(\alpha _\kappa + D \mathbb {Z}\), and conversely any sufficiently large integer from the lattice is contained in the support. [18, Sec. 4.3] showed furthermore that if \(\varvec{\xi }\) is regular critical, then
for some explicitly given constant \(c_{\varvec{\omega }, \kappa }>0\) as \(n \in \alpha _\kappa + D \mathbb {Z}\) tends to infinity. By [18, Prop. 2.1] (see also [13]) it holds for any type \(1 \le \gamma \le d\)
and \(\#_\gamma \varvec{T}^\gamma \) has finite exponential moments. Moreover, [18, Lem. 6.7] showed that for all integers \(1 \le \gamma \le d\)
for a constant \(c_{\gamma }>0\) that does not depend on \(\kappa \). For any subset \(\mathfrak {G}_0 \subset \{1, \ldots , d\}\) let \(v_n\) be a uniformly selected vertex of \(\varvec{T}_n\) with type in \(\mathfrak {G}_0\) and let \(\eta \) denote an independent random type that assumes a type \(\gamma \) with probability proportional to \(c_{\gamma }\). Equations (123) and (124) allow us to apply Theorem 1, yielding local convergence for the vicinity of a random vertex of type \(\gamma \). Equation (125) entails consequently local convergence for the vicinity of \(v_n\) to the corresponding mixture of limit objects:
Theorem 6
Suppose that \(\varvec{\xi }\) is regular critical. Then
as \(n \in \alpha _\kappa + D \mathbb {Z}\) tends to infinity. The limit object does not depend on the type \(\kappa \) with which we started the branching process. Each type recurs almost surely infinitely many often along the backwards growing spine of the limit.
Proposition 5
If \(\mathfrak {G}_0=1\) and if the vector \(\varvec{\omega }\) has only one nonzero coordinate, then Theorem 6 still holds if we only require \(\varvec{\xi }\) to be critical.
Proof
Without loss of generality we may assume that \(\varvec{\omega } = (1,0,\ldots , 0)\). It holds that
and
for all types i, j by [18, Prop. 2.1]. If \(\varvec{T}\) starts with a vertex of type 1, then \(\#_1 \varvec{T}\) is distributed like the population in a critical monotype Galton–Watson tree with offspring distribution \(\#_1 \varvec{T}^11\). In particular, \(\mathbb {P}(\#_1 \varvec{T} = n) = \exp (o(n))\). If \(\varvec{T}\) starts with a vertex of a different type, then \(\#_1 \varvec{T}\) is distributed like the sum of a random number of independent copies of populations of \((\#_1 \varvec{T}^11)\)branching processes. Also in this case, \(\mathbb {P}(\#_1 \varvec{T}=n) = \exp (o(n))\).
For each i let \(v_n^i\) denote a uniformly selected vertex of type i of \(\varvec{T}_n\). Since \(\#_1 \varvec{T}_n = n\) and \(\varvec{T}_n\) is obtained from \(\varvec{T}\) by conditioning on an event with probability \(\exp (o(n))\), we may apply Theorem 1 to obtain
Let \(\alpha \) denote the deterministic root type with which we started the branching process. Let \(\gamma \ne 1\) be a type. It follows from Eqs. (15) and (16) that
with \((\varvec{T}^1_i)_{i \ge 1}\) denoting independent copies of \(\varvec{T}^1\). Truncating the summands and using the Azuma–Hoeffding inequality (and again the fact that \(\mathbb {P}(\#_1 \varvec{T}=n) = \exp (o(n))\)), it follows that for any integer \(D \ge 1\) and any \(\epsilon >0\) it holds with high probability that
As this holds for arbitrarily large D and as \(\mathbb {E}[\#_1 \varvec{T}_i^1] < \infty \), it follows that
This allows us to apply Theorem 1 for \(\kappa = \gamma \) to obtain
\(\square \)
Critical Galton–Watson Trees Conditioned by Typed Populations
Let the type set be given by \(\mathfrak {G} = \{1, \ldots , d\}\) and suppose that the unordered offspring distribution \(\varvec{\xi }\) corresponding to \(\varvec{\sigma }\) is irreducible and critical. Let \(\varLambda \subset \mathbb {N}\) be an infinite subset. Let
be a sequence in \(\varvec{\mathbb {N}}_0^d\) satisfying
for all \(n \in \varLambda \). We assume that
for some \(\varvec{a} = (a_i)_{1 \le i \le d} \in \mathbb {R}^d_{\ge 0} \setminus \{\varvec{0}\}\) as \(n \in \varLambda \) tends to infinity. Let \(\alpha \) be a random type. We let \(\varvec{T}_n\) denote the result of conditioning the \(\varvec{\sigma }\)Galton–Watson tree started with a particle of type \(\alpha \) on the event
Let \(1 \le \kappa \le d\) be a coordinate satisfying \(a_\kappa >0\). By [18, Prop. 2.1] (see also [13]) it holds
It follows by Eqs. (15) and (16) that the event (136) implies that a random number of critical \((\#_\kappa \varvec{T}^\kappa 1)\)Galton–Watson trees has total size \(k_\kappa (n)\). The total population of a critical monotype Galton–Watson tree assumes an integer n with probability \(\exp (o(n))\), yielding for any \(\epsilon >0\)
This verifies Assumption (22). Let \(v_n^\kappa \) denote a uniformly selected vertex of type \(\kappa \) of the tree \(\varvec{T}_n\). It follows by Theorem 1 that
Using (135), we deduce:
Theorem 7
Let \(\mathfrak {G}_0 \subset \mathfrak {G}\) be a subset such that \(a_i>0\) for at least one type \(i \in \mathfrak {G}_0\). Let \(\eta \) be an independent random type from \(\mathfrak {G}_0\) drawn with probability \(\mathbb {P}(\eta = i) = a_i / \sum _{j \in \mathfrak {G}_0} a_j\). Let \(v_n\) denote a vertex of \(\varvec{T}_n\) that is uniformly selected among all vertices with type in \(\mathfrak {G}_0\). Then
See [1, Thm. 3.1] for a limit in a similar setting that describes the asymptotic vicinity of the root.
Notes
 1.
The results of [22] were initially part of the present work. The paper was split during the review process following a referee’s recommendation.
 2.
Here is a helpful analogy: Suppose we count how often the string “and” occurs in a book as consecutive substring. Such occurrences cannot overlap, because no proper initial segment of the string is equal to a tail segment. Hence, if we change one letter of the book, the total number of occurrences may increase by 1, decrease by 1, or stay the same.
References
 1.
Abraham, R., Delmas, J.F., Guo, H.: Critical multitype GaltonWatson trees conditioned to be large. J. Theoret. Probab. 31(2), 757–788 (2018)
 2.
Aldous, D.: Asymptotic fringe distributions for general families of random trees. Ann. Appl. Probab. 1(2), 228–266 (1991)
 3.
Athreya, K. B., Ney, P. E.: Branching processes. SpringerVerlag, New YorkHeidelberg, Die Grundlehren der mathematischen Wissenschaften, Band 196 (1972)
 4.
Bell, J. P., Burris, S. N., Yeats, K. A.: Counting rooted trees: the universal law \(t(n)\sim C\rho ^{n} n^{3/2}\). Electron. J. Combin., 13(1):Research Paper 63, 64 pp. (electronic), (2006)
 5.
de Raphélis, L.: Scaling limit of multitype galtonwatson trees with infinitely many types. Ann. Inst. H. Poincaré Probab. Statist. 53(1), 200–225, 02 (2017)
 6.
Drmota, M., Vatutin, V.: Limiting distributions in branching processes with two types of particles. In Classical and modern branching processes (Minneapolis, MN, 1994), volume 84 of IMA Vol. Math. Appl., pages 89–110. Springer, New York, (1997)
 7.
Féray, V., Kortchemski, I.: The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees. Annales Henri Lebesgue 1, 149–226 (2018)
 8.
Gnedenko, B.V.: On a local limit theorem of the theory of probability. Uspehi Matem. Nauk (N. S.) 3(3(25)), 187–194 (1948)
 9.
Ispány, M., Pap, G.: Asymptotic behavior of critical primitive multitype branching processes with immigration. Stoch. Anal. Appl. 32(5), 727–741 (2014)
 10.
Janson, S.: Simply generated trees, conditioned GaltonWatson trees, random allocations and condensation. Probab. Surv. 9, 103–252 (2012)
 11.
Janson, S., Riordan, O., Warnke, L.: Sesquitype branching processes. Stochastic Process. Appl. 128(11), 3628–3655 (2018)
 12.
Miermont, G.: An invariance principle for random planar maps. In Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, Discrete Math. Theor. Comput. Sci. Proc., AG, pages 39–57. Assoc. Discrete Math. Theor. Comput. Sci., Nancy, (2006)
 13.
Miermont, G.: Invariance principles for spatial multitype GaltonWatson trees. Ann. Inst. Henri Poincaré Probab. Stat. 44(6), 1128–1161 (2008)
 14.
Pénisson, S.: Beyond the \(Q\)process: various ways of conditioning the multitype GaltonWatson process. ALEA Lat. Am. J. Probab. Math. Stat. 13(1), 223–237 (2016)
 15.
Riordan, O., Warnke, L.: The phase transition in boundedsize Achlioptas processes. arXiv:1704.08714, (Apr. 2017)
 16.
Rvacheva, E.: On the domains of attraction for multidimensional stable distributions. Uch. Zap. L’vov University 29, 5–54 (1954)
 17.
Spitzer, F.: Principles of random walk. SpringerVerlag, New YorkHeidelberg, second edition, Graduate Texts in Mathematics, Vol. 34 (1976)
 18.
Stephenson, R.: Local convergence of large critical multitype GaltonWatson trees and applications to random maps. J. Theoret. Probab. 31(1), 159–205 (2018)
 19.
Stufler, B.: Random enriched trees with applications to random graphs. Electronic Journal of Combinatorics 25(3), (2018)
 20.
Stufler, B.: Graphon convergence of random cographs. arXiv:1906.10355, (Jun 2019)
 21.
Stufler, B.: Local limits of large GaltonWatson trees rerooted at a random vertex. Ann. Inst. H. Poincaré Probab. Statist. 55(1), 155–183, 02 (2019)
 22.
Stufler, B.: Quenched local convergence of Boltzmann planar maps. Submitted, (2020)+
 23.
Takács, L.: A generalization of the ballot problem and its application in the theory of queues. J. Amer. Statist. Assoc. 57, 327–337 (1962)
 24.
Vatutin, V., Wachtel, V.: Multitype subcritical branching processes in a random environment. Advances in Applied Probability 50(A), 281–289 (2018)
 25.
Vatutin, V.A.: The structure of the decomposable reduced branching processes. I. Finitedimensional distributions. Theory Probab. Appl. 59(4), 641–662 (2015)
 26.
Vatutin, V.A.: The structure of decomposable reduced branching processes. II. Functional limit theorems. Theory Probab. Appl. 60(1), 103–119 (2016)
 27.
Vatutin, V.A.: A conditional functional limit theorem for decomposable branching processes with two types of particles. Mat. Zametki 101(5), 669–683 (2017)
 28.
Vatutin, V.A., Dyakonova, E.E.: Decomposable branching processes with a fixed extinction moment. Proc. Steklov Inst. Math., 290(1):103–124, Published in Russian in Tr. Mat. Inst. Steklova 290(2015), 114–135 (2015)
 29.
Wilf, H.S generatingfunctionology. A K Peters, Ltd., Wellesley, MA, third edition, (2006)
 30.
Williamson, J.A., Rinehart, G.S.: Remarks on the periodic behavior in time of sums of random variables. Teor. Verojatnost. i Primenen 14, 719–722 (1969)
Acknowledgements
I thank the referees for the thorough reading, helpful recommendations, and corrections.
Funding
Open Access funding provided by TU Wien (TUW).
Author information
Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Stufler, B. Rerooting Multitype Branching Trees: The Infinite Spine Case. J Theor Probab (2021). https://doi.org/10.1007/s1095902001069y
Received:
Revised:
Accepted:
Published:
Keywords
 Multitype Galton–Watson trees
 Fringe distributions
 Local convergence