Name
Abstract | ||
|---|---|---|
Random increasing k-trees represent an interesting and useful class of strongly dependent graphs that have been studied widely, including being used recently as models for complex networks. In this paper we study an informative notion called BFS-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, the resolution of linear systems, and a specially framed notion called Flajolet-Odlyzko admissibility. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1017/S0963548316000018 | COMBINATORICS PROBABILITY & COMPUTING |
DocType | Volume | Issue |
Journal | 25 | 5 |
ISSN | Citations | PageRank |
0963-5483 | 1 | 0.36 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexis Darrasse | 1 | 53 | 4.60 |
| Hsien-Kuei Hwang | 2 | 365 | 38.02 |
| Michèle Soria | 3 | 153 | 16.97 |