Analyticity for rapidly determined properties of Poisson Galton-Watson trees
For \(\lambda > 0\), denote by \(T_\lambda\) a Galton-Watson process with reproduction law Poisson\((\lambda)\). This article takes interest in the regularity of the function \(f_A : \lambda \mapsto \mathbb{P}(T_\lambda \models A)\) for a given tree property \(A\). The authors show that for all first order property \(A\), \(f_A\) is real analytic on \((0,\infty)\). More generally, they show that \(f_A\) is real analytic on an interval \(I\) as soon as there exist \(c,C > 0\) and properties \(A_k\), measurable with respect to the first \(k\) vertices of the tree -- ranked in the breadth-first exploration process -- so that \[ \text{ for all } \lambda \in I, \ \text{ for all } k \in \mathbb{N}, \ \mathbb{P}(T_\lambda \models A \Delta A_k) \leq C e^{-ck}. \] Finally, the authors describe an uncountable family of properties \(A\) that are not of the first order so that \(f_A\) is analytic on \((0,\infty)\).
- First order probabilities for Galton-Watson trees
- Random tree recursions: Which fixed points correspond to tangible sets of trees?
- Quenched survival of Bernoulli percolation on Galton-Watson trees
- Galton-Watson probability contraction
- Asymptotic normality of almost local functionals in conditioned Galton-Watson trees
- Domains of analytic continuation for the top Lyapunov exponent
- First order probabilities for Galton-Watson trees
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
- Galton-Watson probability contraction
- scientific article; zbMATH DE number 1111349 (Why is no real title available?)
- On the Lambert \(w\) function
- Probability on trees and networks
- The probabilistic method
- The strange logic of random graphs
This page was built for publication: Analyticity for rapidly determined properties of Poisson Galton-Watson trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782837)