Analyticity for rapidly determined properties of Poisson Galton-Watson trees

DOI10.1214/20-ECP320zbMATH Open1453.60147arXiv1909.09121OpenAlexW3036861941MaRDI QIDQ782837FDOQ782837

Yuval Peres, Andrew Swan

Publication date: 29 July 2020

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: Let $T_{l}ambda$ be a Galton--Watson tree with Poisson($lambda$) offspring, and let $A$ be a tree property. In this paper, are concerned with the regularity of the function $mathbb{P}_{l}ambda(A):=mathbbP(T_{l}ambdavdashA)$. We show that if a property $A$ can be uniformly approximated by a sequence of properties $A_k$, depending only on the first $k$ vertices in the breadth first exploration of the tree, with a bound in probability of $mathbb{P}_{l}ambda(Ariangle{A}_k)leC{e}^{-ck}$ over an interval $I=(lambd{a}_0,lambd{a}_1)$, then $mathbb{P}_{l}ambda(A)$ is real analytic in $lambda$ for $lambdainI$. We also present some applications of our results, particularly to properties that are not expressible in the first order language of trees.

Full work available at URL: https://arxiv.org/abs/1909.09121

zbMATH Keywords

phase transitionanalytic continuationfirst-order logicGalton-Watson treePoisson offspring distribution

Mathematics Subject Classification ID

Trees (05C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cites Work

• Title not available (Why is that?)
• On the Lambert \(w\) function
• The strange logic of random graphs
• Probability on trees and networks
• The probabilistic method
• Domains of analytic continuation for the top Lyapunov exponent
• Galton-Watson probability contraction
• Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
• First Order Probabilities for Galton–Watson Trees

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)