activity
20082016
most citedA fast and recursive algorithm for clustering large datasets with -medians

6 citations · 7 across the 5 of their papers we have counts for

collaborators

5 papers

math.PR2016

Persistent random walks. II. Functional Scaling Limits

Peggy Cénac, Arnaud Le Ny, Basile De Loynes +1

We give a complete and unified description -- under some stability assumptions -- of the functional scaling limits associated with some persistent random walks for which the recurr…

math.PR2015★ 1 cited

Persistent random walks

Peggy Cénac, Basile De Loynes, Arnaud Le Ny +1

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this pa…

math.PR2011

Uncommon Suffix Tries

Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut +1

Common assumptions on the source producing the words inserted in a suffix trie with leaves lead to a height and saturation level. We provide an example of a suffix tri…

stat.CO2011★ 6 cited

A fast and recursive algorithm for clustering large datasets with -medians

Hervé Cardot, Peggy Cénac, Jean-Marie Monnez

Clustering with fast algorithms large samples of high dimensional data is an important challenge in computational statistics. Borrowing ideas from MacQueen (1967) who introduced a…

math.PR2008

On the Almost Sure Central Limit Theorem for Vector Martingales: Convergence of Moments and Statistical Applications

Bernard Bercu, Peggy Cénac, Guy Fayolle

We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the mome…