output
19972026
most citedAnalysis of a Random Forests Model

678 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2005Show all

13 papers · 1 filter

math.CO2005★ 10 cited

On the formula of Goulden and Rattan for Kerov polynomials

Philippe Biane

We give a simple proof of an explicit formula for Kerov polynomials. This formula is closely related to a formula of Goulden and Rattan.

math.OA2005★ 14 cited

Rectangular random matrices, related free entropy and free Fisher's information

Florent Benaych-Georges

We prove that independent rectangular random matrices, when embedded in a space of larger square matrices, are asymptotically free with amalgamation over a commutative finite dimen…

math.PR2005★ 354 cited

Random trees and applications

Jean-Francois Le Gall

We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we…

math.PR2005★ 1 cited

Regenerative real trees

Mathilde Weill

In this work, we give a description of all sigma-finite measures on the space of rooted compact real trees which satisfy a certain regenerative property. We show that any infinite…

math.PR2005★ 6 cited

The conformally invariant measure on self-avoiding loops

Wendelin Werner

We show that there exists a unique (up to multiplication by constants) and natural measure on simple loops in the plane and on each Riemann surface, such that the measure is confor…

math.NT2005★ 1 cited

Fonctions constructibles exponentielles, transformation de Fourier motivique et principe de transfert

R. Cluckers, F. Loeser

We introduce spaces of exponential constructible functions in the motivic setting for which we construct direct image functors in the absolute and relative cases. This allows us to…

math.ST2005★ 76 cited

Hierarchical testing designs for pattern recognition

Gilles Blanchard, Donald Geman

We explore the theoretical foundations of a ``twenty questions'' approach to pattern recognition. The object of the analysis is the computational process itself rather than probabi…

math.GR2005★ 1 cited

Counting overlattices in automorphism groups of trees

Seonhee Lim

We give an upper bound for the number of ``overlattices'' in the automorphism group of a tree, containing a fixed lattice with index n. For an example of a lattice in the automorph…

math.PR2005

Stochastic flows associated to coalescent processes III: Limit theorems

Jean Bertoin, Jean-François Le Gall

We prove several limit theorems that relate coalescent processes to continuous-state branching processes. Some of these theorems are stated in terms of the so-called generalized Fl…

math.AG2005

Analytic cell decomposition and analytic motivic integration

R. Cluckers, L. Lipshitz, Z. Robinson

The main results of this paper are a Cell Decomposition Theorem for Henselian valued fields with analytic structure in an analytic Denef-Pas language, and its application to analyt…

math.PR2005★ 4 cited

An invariance principle for conditioned trees

Jean-Francois Le Gall

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly vertices. These trees are embedded in the real line by affecti…

math.DS2005

Smoothness of solenoidal attractors

Artur Avila, Sebastien Gouezel, Masato Tsujii

We consider dynamical systems generated by skew products of affine contractions on the real line over angle-multiplying maps on the circle : $ T:S^{1}\times \R\to S^1\times \R…

math-ph2005★ 1 cited

Discrete and continuous Yang-Mills measure for non-trivial bundles over compact surfaces

Thierry Levy

We construct one Yang-Mills measure on a compact surface for each isomorphism class of principal bundles over this surface. For this, we define a new discrete gauge theory which is…