Skip to Main content Skip to Navigation
Journal articles

Shape Measures of Random Increasing k-trees

Alexis Darrasse 1 Hsien-Kuei Hwang Michele Soria 1
1 APR - Algorithmes, Programmes et Résolution
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Random increasing k-trees represent an interesting, useful class of strongly dependent graphs that have been studied widely, including being used recently as models for complex networks. We study in this paper an informative notion called connectivity-profile and derive, by several analytic means, asymptotic estimates for its expected value, together with the limiting distribution in certain cases; some interesting consequences predicting more precisely the shapes of random k-trees are also given. Our methods of proof rely essentially on a bijection between k-trees and ordinary trees, and the resolution of a linear system.
Document type :
Journal articles
Complete list of metadata
Contributor : Michèle Soria Connect in order to contact the contributor
Submitted on : Tuesday, August 30, 2016 - 3:03:42 PM
Last modification on : Friday, January 8, 2021 - 5:32:06 PM

Links full text



Alexis Darrasse, Hsien-Kuei Hwang, Michele Soria. Shape Measures of Random Increasing k-trees. Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2016, 25, pp.668-699. ⟨10.1017/S0963548316000018⟩. ⟨hal-01357827⟩



Les métriques sont temporairement indisponibles