39 citations · 96 across the 20 of their papers we have counts for
23 papers
How often is one-to-one in ?
Olivier Garet
We characterize the integers n such that describes a bijection from the set to itself and we determine the frequency of these integers. Prec…
Probabilistic proof for non-survival at criticality : the Galton-Watson process and more
Olivier Garet
In a famous paper, Bezuidenhout and Grimmett demonstrated that the contact process dies out at the critical point.Their proof technique has often been used to study the growth of p…
A central limit theorem for the number of descents and some urn models
Olivier Garet
The purpose of this work is to establish a central limit theorem that can be applied to a particular form of Markov chains, including the number of descents in a random permutation…
A simple master Theorem for discrete divide and conquer recurrences
Olivier Garet
The aim of this note is to provide a Master Theorem for some discrete divide and conquer recurrences: where the $m…
Percolation and first-passage percolation on oriented graphs
Olivier Garet, Régine Marchand
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices that are translation-invariant and may contain loops. We exhibi…
Does Eulerian percolation on percolate ?
Olivier Garet, Regine Marchand, Irène Marcovici
Eulerian percolation on Z 2 with parameter p is the classical Bernoulli bond percolation with parameter p conditioned on the fact that every site has an even degree. We first expla…