The connectivity-profile of random increasing k-trees

The connectivity-profile of random increasing k-trees

Cached

Download Links

by Alexis Darrasse , Hsien-kuei Hwang , Michèle Soria , Olivier Bodini

Citations:

BibTeX

@MISC{Darrasse_theconnectivity-profile,
    author = {Alexis Darrasse and Hsien-kuei Hwang and Michèle Soria and Olivier Bodini},
    title = {The connectivity-profile of random increasing k-trees},
    year = {}
}

Bookmark

OpenURL

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. 1

Citations

913	The Structure and Function of Complex Networks - Newman
200	Analytic Combinatorics - Flajolet, Sedgewick - 2009
113	On the altitude of nodes in random trees - Meir, Moon - 1978
47	Varieties of increasing trees - Bergeron, Flajolet, et al. - 1992
40	On the profile of random trees - Drmota, Gittenberger - 1997
32	Andrzej Proskurowski. Complexity of finding embeddings in a k-tree - Arnborg, Corneil - 1987
30	Martingales and profile of binary search trees - Chauvin, Klein, et al.
18	On the profile of random trees, Random Structures and Algorithms - Drmota, Gittenberger - 1997
17	An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms - Chern, Hwang, et al. - 2002
15	A functional limit theorem for the profile of search trees - Drmota, Janson, et al.
14	2006, “Profiles of random trees: Limit theorems for random recursive trees and binary search trees - Fuchs, Hwang, et al.
13	The number of labeled k-dimensional trees - Beineke, Pippert - 1969
13	Profiles of random trees: Plane-oriented recursive trees,” Random Structures and Algorithms - Hwang - 2007
12	Gábor Tusnády. The degree sequence of a scale-free random graph process. Random Struct - Bollobás, Riordan, et al. - 2001
7	On simple characterization of k-trees. Discrete mathematics - Rose - 1974
6	Apollonian networks: Simultaneously scale-free, small world, euclidean, space filling, and with matching graphs - Andrade, Herrmann, et al. - 2005
6	On the Number of Plane 2-trees - Palmer, Read - 1973
5	On the expected depth of random circuits - Arya, Golin, et al.
4	Long and short paths in uniform random recursive dags. Arkiv för Matematik (to appear - Devroye, Janson - 2009
4	Labelled and unlabelled enumeration of k-gonal 2-trees - Labelle, Lamathe, et al. - 2004
4	Detection, understanding, and prevention of traceroute measurement artifacts - Viger, Augustin, et al.
2	The degree distribution of random k-trees - Gao
2	J.F.: Some families of increasing planar maps Electronic - Albenque, Marckert
2	K-trees: representation and distances - Proskurowski - 1980
2	Francesc Comellas. High-dimensional random apollonian networks - Zhang, Rong
1	Jean-François Marckert, and Alain Rouault. Martingales and profile of binary search trees - Chauvin, Klein - 2005
1	Limiting distribution for distances in k-trees - Darrasse, Soria
1	A unifying structural approach to the analysis of parameters in k-trees - Darrasse, Soria, et al.
1	Random Graph Dynamics. Number 20 - Durrett - 2006
1	Wojciech Szpankowski. Profiles of tries - Park, Hwang, et al.
1	Chapter 8, traceroute program - Stevens - 1994