ARAlain Rouault

Alain Rouault

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alain Rouault has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Martingales and Rates of Presence in Homogeneous Fragmentations

    by Nathalie Krell, Alain Rouault

    The main focus of this work is the asymptotic behavior of mass-conservative homogeneous fragmentations. Considering the logarithm of masses makes the situation reminiscent of branching random walks. The standard approach is to study {\bf asymptotical} exponential rates. For fixed $v > 0$, either the number of fragments whose sizes at time $t$ are of order $\e^{-vt}$ is exponentially growing with rate $C(v) > 0$, i.e. the rate is effective, or the probability of presence of such fragments is exponentially decreasing with rate $C(v) < 0$, for some concave function $C$. In a recent paper, N. Krell considered fragments whose sizes decrease at {\bf exact} exponential rates, i.e. whose sizes are confined to be of order $\e^{-vs}$ for every $s \leq t$. In that setting, she characterized the effective rates. In the present paper we continue this analysis and focus on probabilities of presence, using the spine method and a suitable martingale.

  • Open Access

    On the reduction of a random basis

    by Ali Akhavi, Jean-François Marckert, Alain Rouault

    For $g < n$, let $b\_1,...,b\_{n-g}$ be $n - g$ independent vectors in $\mathbb{R}^n$ with a common distribution invariant by rotation. Considering these vectors as a basis for the Euclidean lattice they generate, the aim of this paper is to provide asymptotic results when $n\to +\infty$ concerning the property that such a random basis is reduced in the sense of {\sc Lenstra, Lenstra & Lov\'asz}. The proof passes by the study of the process $(r\_{g+1}^{(n)},r\_{g+2}^{(n)},...,r\_{n-1}^{(n)})$ where $r\_j^{(n)}$ is the ratio of lengths of two consecutive vectors $b^*\_{n-j+1}$ and $b^*\_{n-j}$ built from $(b\_1,...,b\_{n-g})$ by the Gram--Schmidt orthogonalization procedure, which we believe to be interesting in its own. We show that, as $n\to+\infty$, the process $(r\_j^{(n)}-1)\_j$ tends in distribution in some sense to an explicit process $({\mathcal R}\_j -1)\_j$; some properties of this latter are provided.

  • Open Access

    Pathwise asymptotic behavior of random determinants in the uniform Gram and Wishart ensembles

    by Alain Rouault

    This paper concentrates on asymptotic properties of determinants of some random symmetric matrices. If B_{n,r} is a n x r rectangular matrix and B_{n,r}' its transpose, we study det (B_{n,r}'B_{n,r}) when n,r tends to infinity with r/n \to c\in (0,1). The r column vectors of B_{n,r} are chosen independently, with common distribution \nu_n. The Wishart ensemble corresponds to \nu_n = {\cal N}(0, I_n), the standard normal distribution. We call uniform Gram ensemble the ensemble corresponding to \nu_n = \sigma_n, the uniform distribution on the unit sphere `S_{n-1}. In the Wishart ensemble, a well known Bartlett's theorem decomposes the above determinant into a product of chi-square variables. The same holds in the uniform Gram ensemble. This allows us to study the process \{\frac{1}{n}\log \det\big(B_{n,\lfloor nt\rfloor}'B_{n,\lfloor nt\rfloor}\big), t \in [0,1]\} and its asymptotic behavior as n\to \infty: a.s. convergence, fluctuations, large deviations. We connect the results for marginals (fixed t) with those obtained by the spectral method.

  • Open Access

    Connecting Yule Process, Bisection and Binary Search Tree via Martingales

    by B. Chauvin, A. Rouault

    We present new links between some remarkable martingales found in the study of the Binary Search Tree, or of the Bisection Problem, looking at them on the probability space of a continuous time binary branching process.

  • Open Access

    Asymptotical behaviour of the presence probability in branching random walks and fragmentations

    by Jean Bertoin, Alain Rouault

    For a subcritical Galton-Watson process $(\zeta_n)$, it is well known that under an $X \log X$ condition, the quotient $P(\zeta_n > 0)/ E\zeta_n$ has a finite positive limit. There is an analogous result for a (one-dimensional) supercritical branching random walk: when $a$ is in the so-called subcritical speed area, the probability of presence around $na$ in the $n$-th generation is asymptotically proportional to the corresponding expectation. In Rouault (1993) this result was stated under a natural $X \log X$ assumption on the offspring point process and a (unnatural) condition on the offspring mean. Here we prove that the result holds without this latter condition, in particular we allow an infinite mean and a dimension $d \geq 1$ for the state-space. As a consequence the result holds also for homogeneous fragmentations as defined in Bertoin (2001), using the method of discrete-time skeletons; this completes the proof of Theorem 4 in Bertoin-Rouault (2004 see math/PR/0409545). Finally, an application to conditioning on the presence allows to meet again the probability tilting and the so-called additive martingale.

  • Open Access

    Discretization methods for homogeneous fragmentations

    by Jean Bertoin, Alain Rouault

    Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of time-discretization to shift known results from the theory of branching random walks to the fragmentation setting. In particular, this yields interesting information about the asymptotic behaviour of fragmentations. On the other hand, homogeneous fragmentations can also be investigated using a powerful technique of discretization of space due to Kingman, namely, the theory of exchangeable partitions of $\N$. Spatial discretization is especially well-suited to develop directly for continuous times the conceptual method of probability tilting of Lyons, Pemantle and Peres.

  • Limit Theorems for Multiplicative Processes

    by Quansheng Liu, Emmanuel Rio, Alain Rouault