Résumé: A random tree T(n) of order n is constructed by choosing in a random tree T(n-1) of order n-1 a vertex at random and connecting it to a new vertex labeled n. In the usual constraint we assume that the n-1 vertices of T(n-1) are equally likely to be chosen. We introduce and research a more general case in which a distribution of choosing vertices is defined by a sequence &agr;(1), &agr;(2), DE : Mathématiques; Informatique ; Théorie ; Modèle mathématique ; Fonction récursive ; Processus aléatoire ; Théorie contrainte ; Algorithme ; Arbre(mathématiques)

Langue: Anglais