{"title":"Limit theorems for the maximal tree size of a Galton – Watson forest in the critical case","authors":"Elena V. Khvorostianskaia","doi":"10.1515/dma-2023-0019","DOIUrl":null,"url":null,"abstract":"Abstract We consider a critical Galton – Watson branching process starting with N particles; the number of offsprings is supposed to have the distribution pk=(k + 1)−τ−(k + 2)−τ, k=0, 1, 2, … Limit distributions of the maximal tree size are obtained for the corresponding Galton – Watson forest with N trees and n non-root vertices as N, n → ∞, n/Nτ ⩾ C > 0.","PeriodicalId":11287,"journal":{"name":"Discrete Mathematics and Applications","volume":"33 1","pages":"205 - 217"},"PeriodicalIF":0.3000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/dma-2023-0019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract We consider a critical Galton – Watson branching process starting with N particles; the number of offsprings is supposed to have the distribution pk=(k + 1)−τ−(k + 2)−τ, k=0, 1, 2, … Limit distributions of the maximal tree size are obtained for the corresponding Galton – Watson forest with N trees and n non-root vertices as N, n → ∞, n/Nτ ⩾ C > 0.
期刊介绍：
The aim of this journal is to provide the latest information on the development of discrete mathematics in the former USSR to a world-wide readership. The journal will contain papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications will cover various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
