| Issue |
RAIRO-Theor. Inf. Appl.
Volume 57, 2023
|
|
|---|---|---|
| Article Number | 5 | |
| Number of page(s) | 14 | |
| DOI | https://doi.org/10.1051/ita/2023003 | |
| Published online | 14 July 2023 | |
Note on the exponential recursive k-ary trees
1
Department of Statistics, Faculty of Mathematical Sciences, University of Tabriz, Tabriz, Iran
2
Department of Statistics, Faculty of Sciences, University of Zanjan, Zanjan, Iran
* Corresponding author: javanian@znu.ac.ir
Received:
6
April
2022
Accepted:
17
February
2022
In the present paper, we consider exponential recursive trees with no node of outdegree greater than k, called exponential recursive k-ary trees (k ≥ 2). At each step of growing of these trees, every external node (insertion position) is changed into a leaf with probability p, or fails to do so with probability 1 — p. We investigate limiting behavior of fundamental parameters such as size, leaves and distances in exponential recursive k-ary trees.
Mathematics Subject Classification: 05C05 / 60C05 / 60F05 / 60G42
Key words: Recursive k-ary trees / contraction method / almost sure convergence / martingale
© The authors. Published by EDP Sciences, 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.