Geodesic
The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

We prove a limit theorem for the total Steiner $k$-distance of a random $b$-ary recursive tree with weighted edges. The total Steiner $k$-distance is the sum of all Steiner $k$-distances in a tree and it generalises the Wiener index. The limit theorem is obtained by using a limit theorem in the general setting of the contraction method. In order to use the contraction method we prove a recursion formula and determine the asymptotic expansion of the expectation using the so-called Master Theorem by Roura (2001). In a second step we prove a transformation of the total Steiner $k$-distance of $b$-ary trees with weighted edges to arbitrary recursive trees. This transformation yields the limit theorem for the total Steiner $k$-distance of the linear recursive trees when the parameter of these trees is a non-negative integer. 
@article{DMTCS_2010_special_258_a15,
     author = {Munsonius, G\"otz Olaf},
     title = {The total {Steiner} $k$-distance for $b$-ary recursive trees and linear recursive trees},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2779},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2779/}
}
TY  - JOUR
AU  - Munsonius, Götz Olaf
TI  - The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2779/
DO  - 10.46298/dmtcs.2779
LA  - en
ID  - DMTCS_2010_special_258_a15
ER  - 
%0 Journal Article
%A Munsonius, Götz Olaf
%T The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2779/
%R 10.46298/dmtcs.2779
%G en
%F DMTCS_2010_special_258_a15
Munsonius, Götz Olaf. The total Steiner $k$-distance for $b$-ary recursive trees and linear recursive trees. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2779. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2779/

Cité par Sources :