A central limit theorem for almost local additive tree functionals

From MaRDI portal
Publication:2292863

DOI10.1007/S00453-019-00622-4zbMATH Open1446.60011arXiv1810.00467OpenAlexW3101721269MaRDI QIDQ2292863FDOQ2292863


Authors: Dimbinaina Ralaivaosaona, M. Şileikis, Stephan Wagner Edit this on Wikidata


Publication date: 6 February 2020

Published in: Algorithmica (Search for Journal in Brave)

Abstract: An additive functional of a rooted tree is a functional that can be calculated recursively as the sum of the values of the functional over the branches, plus a certain toll function. Janson recently proved a central limit theorem for additive functionals of conditioned Galton-Watson trees under the assumption that the toll function is local, i.e. only depends on a fixed neighbourhood of the root. We extend his result to functionals that are "almost local" in a certain sense, thus covering a wider range of functionals. The notion of almost local functional intuitively means that the toll function can be approximated well by considering only a neighbourhood of the root. Our main result is illustrated by several explicit examples including natural graph theoretic parameters such as the number of independent sets, the number of matchings, and the number of dominating sets. We also cover a functional stemming from a tree reduction process that was studied by Hackl, Heuberger, Kropf, and Prodinger.


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




Recommendations




Cites Work


Cited In (10)





This page was built for publication: A central limit theorem for almost local additive tree functionals

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