The connectivity-profile of random increasing k-trees
Combinatorics
2009-10-20 v1
Abstract
Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this paper a notion called connectivity-profile and derive asymptotic estimates for it; some interesting consequences will also be given.
Cite
@article{arxiv.0910.3639,
title = {The connectivity-profile of random increasing k-trees},
author = {Alexis Darrasse and Hsien-Kuei Hwang and Olivier Bodini and Michèle Soria},
journal= {arXiv preprint arXiv:0910.3639},
year = {2009}
}