4 citations · 5 across the 3 of their papers we have counts for
3 papers
math.PR2016
Measure-valued Pólya processes
Cécile Mailler, Jean-François Marckert
A Pólya urn process is a Markov chain that models the evolution of an urn containing some coloured balls, the set of possible colours being for .…
cs.DC2006★ 1 cited
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
Christian Lavault, Jean-François Marckert, Vlady Ravelomanana
Radio networks (RN) are distributed systems (\textit{ad hoc networks}) consisting in radio stations. Assuming the number unknown, two distinct models of RN without co…
math.PR2004★ 4 cited
Martingales and Profile of Binary Search Trees
Brigitte Chauvin, Thierry Klein, Jean-Francois Marckert +1
We are interested in the asymptotic analysis of the binary search tree (BST) under the random permutation model. Via an embedding in a continuous time model, we get new results, in…