Protected node profile of Tries
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1
Voir la notice de l'article provenant de la source Episciences
In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models. Protected node profile measures the number of protected nodes with the same distance from the root in rooted trees. For no rooted tree, protected node profile has been investigated so far. Here, we present the asymptotic expectations, variances, covariance and limiting bivariate distribution of protected node profile and non-protected internal node profile in random tries, an important data structure on words in computer science. Also we investigate the fraction of these expectations asymptotically. These results are derived by the methods of analytic combinatorics such as generating functions, Mellin transform, Poissonization and depoissonization, saddle point method and singularity analysis.
@article{DMTCS_2018_20_1_a11,
author = {Javanian, Mehri},
title = {Protected node profile of {Tries}},
journal = {Discrete mathematics & theoretical computer science},
publisher = {mathdoc},
volume = {20},
number = {1},
year = {2018},
doi = {10.23638/DMTCS-20-1-12},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-1-12/}
}
Javanian, Mehri. Protected node profile of Tries. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 1. doi: 10.23638/DMTCS-20-1-12
Cité par Sources :