Shape Measures of Random Increasing k-trees - Archive ouverte HAL Access content directly
Journal Articles Combinatorics, Probability and Computing Year : 2016

Shape Measures of Random Increasing k-trees

Alexis Darrasse
  • Function : Author
  • PersonId : 850194
Hsien-Kuei Hwang
  • Function : Author
  • PersonId : 936028
Michele Soria


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.

Dates and versions

hal-01357827 , version 1 (30-08-2016)



Alexis Darrasse, Hsien-Kuei Hwang, Michele Soria. Shape Measures of Random Increasing k-trees. Combinatorics, Probability and Computing, 2016, 25, pp.668-699. ⟨10.1017/S0963548316000018⟩. ⟨hal-01357827⟩
98 View
0 Download



Gmail Facebook X LinkedIn More