On the maximal Galton-Watson forest tree with infinite variance of the offspring

IF 0.2 Q4 MATHEMATICS, APPLIED
Юрий Леонидович Павлов, Yu. L. Pavlov
{"title":"On the maximal Galton-Watson forest tree with infinite variance of the offspring","authors":"Юрий Леонидович Павлов, Yu. L. Pavlov","doi":"10.4213/dm1765","DOIUrl":null,"url":null,"abstract":"Рассматриваются леса Гальтона - Ватсона, образованные начинающимся с $N$ частиц критическим ветвящимся процессом, общее число потомков которых за все время эволюции равно $n$. Число прямых потомков каждой частицы имеет распределение \\begin{equation*}p_k=\\frac{h(k+1)}{(k+1)^\\tau}, \\qquad k=0,1,2, …, \\quad \\tau\\in (2,3),\\end{equation*} где $h(k)$ - медленно меняющаяся на бесконечности функция. Найдено предельное распределение максимального объема дерева, если $N,n\\rightarrow \\infty$ и существует $\\alpha >0$ такое,что $n/N^{\\tau-1+\\alpha} \\rightarrow \\infty.$","PeriodicalId":42607,"journal":{"name":"Prikladnaya Diskretnaya Matematika","volume":"17 1","pages":""},"PeriodicalIF":0.2000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Prikladnaya Diskretnaya Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4213/dm1765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

Рассматриваются леса Гальтона - Ватсона, образованные начинающимся с $N$ частиц критическим ветвящимся процессом, общее число потомков которых за все время эволюции равно $n$. Число прямых потомков каждой частицы имеет распределение \begin{equation*}p_k=\frac{h(k+1)}{(k+1)^\tau}, \qquad k=0,1,2, …, \quad \tau\in (2,3),\end{equation*} где $h(k)$ - медленно меняющаяся на бесконечности функция. Найдено предельное распределение максимального объема дерева, если $N,n\rightarrow \infty$ и существует $\alpha >0$ такое,что $n/N^{\tau-1+\alpha} \rightarrow \infty.$
子代方差无穷大的极大高尔顿-沃森森林树
在这里,galton - watson森林以N美元为起点,以一个关键的分支过程开始,其后代总数为N美元。数字每个粒子分布的直系后裔begin {equation * p_k施工= h (k + 1) / frac {} {(k + 1) ^ \ tau} / qquad k = 0,1,2,……,华硕,tau in(2.3%)、美元/ end {equation *}哪里h (k)美元缓慢变化无穷函数。找到极限分布最大体积的树木,如果美元N, N \ rightarrow \ infty美元和现有美元\ alpha > 0 $, $ N / N ^ {\ tau - 1美元+ alpha / rightarrow \ infty施工。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Prikladnaya Diskretnaya Matematika
Prikladnaya Diskretnaya Matematika MATHEMATICS, APPLIED-
CiteScore
0.60
自引率
50.00%
发文量
0
期刊介绍: The scientific journal Prikladnaya Diskretnaya Matematika has been issued since 2008. It was registered by Federal Control Service in the Sphere of Communications and Mass Media (Registration Witness PI № FS 77-33762 in October 16th, in 2008). Prikladnaya Diskretnaya Matematika has been selected for coverage in Clarivate Analytics products and services. It is indexed and abstracted in SCOPUS and WoS Core Collection (Emerging Sources Citation Index). The journal is a quarterly. All the papers to be published in it are obligatorily verified by one or two specialists. The publication in the journal is free of charge and may be in Russian or in English. The topics of the journal are the following: 1.theoretical foundations of applied discrete mathematics – algebraic structures, discrete functions, combinatorial analysis, number theory, mathematical logic, information theory, systems of equations over finite fields and rings; 2.mathematical methods in cryptography – synthesis of cryptosystems, methods for cryptanalysis, pseudorandom generators, appreciation of cryptosystem security, cryptographic protocols, mathematical methods in quantum cryptography; 3.mathematical methods in steganography – synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security; 4.mathematical foundations of computer security – mathematical models for computer system security, mathematical methods for the analysis of the computer system security, mathematical methods for the synthesis of protected computer systems;[...]
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信