This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs). A first parameter which is studied is the result of arithmetical expressions drawn at random. An application is the heuristic improvement of an algorithm of research of RNA secondary structures. Another parameter I study is the size of logical or arithmetical expressions reduced according to idempotent, nilpotent or absorption laws. I study polynomial functionals of standard Brownian motion, of Brownian bridge, meander and excursion with the use of the method of moments which relies on generating functions and singularity analysis. I obtain the Gaussian limit of the joint law of the size and the internal path length of tries with Bernoulli...
AbstractWe analyse q-functional equations arising from tree-like combinatorial structures, which are...
L'objectif de cette thèse est l'étude des approximations et des vitesses de convergence pour des fon...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
Je présente dans ce mémoire mes travaux sur les limites d'échelle de grandes structures aléatoires. ...
AbstractAdditive tree functionals represent the cost of many divide-and-conquer algorithms. We deriv...
International audienceWe consider random rooted maps without regard to their genus, with fixed large...
Consider a rooted tree with branching factor b ? 1 having b h leafs, each at distance h from the r...
The aim of this thesis is the study of approximations and rates of convergence for functionals of la...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
On s'intéresse dans ce manuscrit à des problèmes d'inférence dans des graphes aléatoires de grande t...
This thesis studies P lya urns through the analytic combinatorics point of view. Urns are conceptual...
Nous nous intéressons à trois problèmes issus du monde des arbres aléatoires discrets et continus. D...
Many parameters of trees are additive in the sense that they can be computed recursively from the su...
Chapter one deals with the asymptotics of random walks with a given number of peaks (a pic is a loca...
AbstractWe analyse q-functional equations arising from tree-like combinatorial structures, which are...
L'objectif de cette thèse est l'étude des approximations et des vitesses de convergence pour des fon...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...
This thesis studies the limit distribution of parameters recursively defined on trees (rooted graphs...
Je présente dans ce mémoire mes travaux sur les limites d'échelle de grandes structures aléatoires. ...
AbstractAdditive tree functionals represent the cost of many divide-and-conquer algorithms. We deriv...
International audienceWe consider random rooted maps without regard to their genus, with fixed large...
Consider a rooted tree with branching factor b ? 1 having b h leafs, each at distance h from the r...
The aim of this thesis is the study of approximations and rates of convergence for functionals of la...
AbstractWe consider distributional recursions which appear in the study of random binary search tree...
On s'intéresse dans ce manuscrit à des problèmes d'inférence dans des graphes aléatoires de grande t...
This thesis studies P lya urns through the analytic combinatorics point of view. Urns are conceptual...
Nous nous intéressons à trois problèmes issus du monde des arbres aléatoires discrets et continus. D...
Many parameters of trees are additive in the sense that they can be computed recursively from the su...
Chapter one deals with the asymptotics of random walks with a given number of peaks (a pic is a loca...
AbstractWe analyse q-functional equations arising from tree-like combinatorial structures, which are...
L'objectif de cette thèse est l'étude des approximations et des vitesses de convergence pour des fon...
AbstractIf a recursive tree is selected uniformly at random from among all recursive trees on n vert...