Barycentres de matrices idempotentes stochastiques
Block distribution in random strings
For almost all infinite binary sequences of Bernoulli trials the frequency of blocks of length in the first terms tends asymptotically to the probability of the blocks, if increases like (for ) where tends to . This generalizes a result due to P. Flajolet, P. Kirschenhofer and R.F. Tichy concerning the case .
Bornes inférieures pour les marches aléatoires sur les groupes p-adiques moyennables
Bounds on random infinite urn model.
Branching random walks on binary search trees: convergence of the occupation measure
We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description of the...
Brownian local times.
Brownian motion and random walks on manifolds
We develop a procedure that allows us to “descretise” the Brownian motion on a Riemannian manifold. We construct thus a random walk that is a good approximation of the Brownian motion.
Brownian motion and transient groups
In this paper I consider a covering of a Riemannian manifold . I prove that Green’s function exists on if any and only if the symmetric translation invariant random walks on the covering group are transient (under the assumption that is compact).
Brownian motion, bridge excursion, and meander characterized by sampling at independent uniform times.