Galton-Watson probability contraction

From MaRDI portal
Publication:516101




Abstract: We are concerned with exploring the probabilities of first order statements for Galton-Watson trees with Poisson(c) offspring distribution. Fixing a positive integer k, we exploit the k-move Ehrenfeucht game on rooted trees for this purpose. Let Sigma, indexed by 1leqjleqm, denote the finite set of equivalence classes arising out of this game, and D the set of all probability distributions over Sigma. Let xj(c) denote the true probability of the class jinSigma under Poisson(c) regime, and vecx(c) the true probability vector over all the equivalence classes. Then we are able to define a natural recursion function Gamma, and a map Psi=Psic:DightarrowD such that vecx(c) is a fixed point of Psic, and starting with any distribution vecxinD, we converge to this fixed point via Psi because it is a contraction. We show this both for cleq1 and c>1, though the techniques for these two ranges are quite different.









This page was built for publication: Galton-Watson probability contraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516101)