Publications de Chauvin :

The growing trees distribution on Boolean functions. [Version pdf] Brigitte Chauvin, Danièle Gardy and Cécile Mailler. In proc. 8th SIAM Workshop on Analytic and Combinatorics (ANALCO), pp 45-56, 2011.

Context trees, variable length Markov chains and dynamical systems. . B. Chauvin, P. Cénac, F. Paccaut, N. Pouyanne. Séminaire de Probabilités, Lecture Notes in Mathematics, Springer Verlag. A paraître.

Limit distributions for large Polya urns. Brigitte Chauvin, Nicolas Pouyanne and Reda Sahnoun. Annals of Applied Probability (2011), Vol. 21, No. 1, 1--32.

Support and density of the limit $m$-ary search trees distribution. Brigitte Chauvin, Quansheng Liu and Nicolas Pouyanne. Discrete Mathematics and Theoretical Computer Science, AQ (2012), p. 191--200.

Context trees, variable length Markov chains and dynamical systems. Brigitte Chauvin, Peggy Cenac, Frédéric Paccaut et Nicolas Pouyanne. XLIV, 1--40, (2012), Lecture Notes in Mathematics, Springer.

Uncommon suffix tries. Brigitte Chauvin, Peggy Cenac, Frédéric Paccaut et Nicolas Pouyanne. Random Structures and Algorithms. A paraître.

Limit distributions for multitype branching processes of $m$-ary search trees. Brigitte Chauvin, Quansheng Liu et Nicolas Pouyanne. Annales de l'Institut Henri Poincaré, à paraître (2013).

Persistent random walk assiociated with variable length Markov chains. Brigitte Chauvin, Peggy Cenac, Samuel Hermann et Pierre Valois. Markov Processes and Related Fields, à paraître.

A new probability distribution for Boolean functions: the growing tree distribution. Brigitte Chauvin, Danièle Gardy et Cécile Mailler. Random Structures and Algorithms, à paraître.

Smoothing equations for large Polya urns. Brigitte Chauvin, Cécile Mailler et Nicolas Pouyanne. Journal of Theoretical Probability, (2013).