The degree profile of random Polya trees

被引：0

作者：

Gittenberger, Bernhard ^{[1
]}

Kraus, Veronika ^{[2
]}

机构：

[1] TU Wien, Inst Discrete Math & Geometry, A-1040 Vienna, Austria

[2] UMIT, Inst Bioinformat & Translat Res, A-6020 Hall In Tirol, Austria

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES A | 2012年 / 119卷 / 07期

关键词：

Unlabelled trees; Profile; Nodes of fixed degree; Brownian excursion; Local time; BINARY SEARCH-TREES; RANDOM RECURSIVE TREES; FUNCTIONAL LIMIT-THEOREM; CONTINUUM RANDOM TREE; LARGE PLANAR MAPS; BROWNIAN EXCURSION; LOCAL TIME; DENSITY; FORESTS; HEIGHT;

D O I：

10.1016/j.jcta.2012.04.007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We investigate the profile of random Polya trees of size n when only nodes of degree d are counted in each level. It is shown that, as in the case where all nodes contribute to the profile, the suitably normalized profile process converges weakly to a Brownian excursion local time. Moreover, we investigate the joint distribution of the number of nodes of degrees d(1) and d(2) on the same level of the tree. (C) 2012 Elsevier Inc. All rights reserved.

引用

页码：1528 / 1557

页数：30

共 50 条

[21] Depth of vertices with high degree in random recursive trees
Eslava, Laura
ALEA-LATIN AMERICAN JOURNAL OF PROBABILITY AND MATHEMATICAL STATISTICS, 2022, 19 (01): : 839 - 857
[22] PROTECTION NUMBERS IN SIMPLY GENERATED TREES AND POLYA TREES
Golebiewski, Zbigniew
Larcher, Isabella
Sulkowska, Malgorzata
APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2023, 17 (01) : 1 - 24
[23] On the shape of random Polya structures
Gittenberger, Bernhard
Jin, Emma Yu
Wallner, Michael
DISCRETE MATHEMATICS, 2018, 341 (04) : 896 - 911
[24] A functional limit theorem for the profile of random recursive trees
Iksanov, Alexander
Kabluchko, Zakhar
ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2018, 23 : 1 - 13
[25] The random walks of George Polya
Alexander, DS
HISTORIA MATHEMATICA, 2004, 31 (02) : 222 - 226
[26] THE DEGREE PROFILE AND WEIGHT IN APOLLONIAN NETWORKS AND k-TREES
Zhang, Panpan
Mahmoud, Hosam
ADVANCES IN APPLIED PROBABILITY, 2016, 48 (01) : 163 - 175
[27] DEGREE-DEPENDENT THRESHOLD-BASED RANDOM SEQUENTIAL ADSORPTION ON RANDOM TREES
Meyfroyt, Thomas M. M.
ADVANCES IN APPLIED PROBABILITY, 2018, 50 (01) : 302 - 326
[28] Polya's Theorem on Random Walks via Polya's Urn
Levin, David A.
Peres, Yuval
AMERICAN MATHEMATICAL MONTHLY, 2010, 117 (03): : 220 - 231
[29] Computationally tractable approximate and smoothed Polya trees
William Cipolli
Timothy Hanson
Statistics and Computing, 2017, 27 : 39 - 51
[30] Supervised learning via smoothed Polya trees
Cipolli, William, III
Hanson, Timothy
ADVANCES IN DATA ANALYSIS AND CLASSIFICATION, 2019, 13 (04) : 877 - 904

← 1 2 3 4 5 →