Note on the exponential recursive k -ary trees

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...

Full description

Saved in:
Bibliographic Details
Published inRAIRO. Informatique théorique et applications Vol. 57; p. 5
Main Authors Ghasemi, Mina, Javanian, Mehri, Nabiyyi, Ramin Imany
Format Journal Article
LanguageEnglish
Published 2023
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0988-3754
2804-7346
DOI:10.1051/ita/2023003