#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2002

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Brigitte Chauvin, Nicolas Pouyanne
- Random Struct. Algorithms
- 2004

- Nicolas Pouyanne
- 2006

Pólya processes are natural generalization of Pólya-Eggenberger urn models. This article presents a new approach of their asymptotic behaviour via moments, based on the spectral decomposition of a suitable finite difference transition operator on polynomial functions. Especially, it provides new results for large processes (a Pólya process is called small… (More)

- Nicolas Pouyanne
- 2005

This article deals with Pólya generalized urn models with constant balance in any dimension. It is based on the algebraic approach of Pouyanne (2005) and classifies urns having “large” eigenvalues in five classes, depending on their almost sure asymptotics. These classes are described in terms of the spectrum of the urn’s replacement matrix and examples of… (More)

- Philippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne
- Electr. J. Comb.
- 2006

A “hybrid method”, dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux’s method and singularity analysis theory. This hybrid method applies to functions that remain of moderate growth near the unit circle and satisfy suitable smoothness assumptions—this, even in the case when the unit… (More)

Abstract. We consider a two colors Pólya urn with balance S. Assume it is a large urn i.e. the second eigenvalue m of the replacement matrix satisfies 1/2 < m/S ≤ 1. After n drawings, the composition vector has asymptotically a first deterministic term of order n and a second random term of order n. The object of interest is the limit distribution of this… (More)

- Nicolas Pouyanne
- Electr. J. Comb.
- 2002

Let m be a positive integer, and pn(m) the proportion of permutations of the symmetric group Sn that admit an m-th root. Calculating the exponential generating function of these permutations, we show the following asymptotic formula pn(m) ∼ n→+∞ πm n1−φ(m)/m , where φ is the Euler function and πm an explicit constant.

Infinite random sequences of letters can be viewed as stochastic chains or as strings produced by a source, in the sense of information theory. The relationship between Variable Length Markov Chains (VLMC) and probabilistic dynamical sources is studied. We establish a probabilistic frame for context trees and VLMC and we prove that any VLMC is a dynamical… (More)

- Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut, Nicolas Pouyanne
- Random Struct. Algorithms
- 2015

Common assumptions on the source producing the words inserted in a suffix trie with n leaves lead to a lnn height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of n and another one whose saturation level is negligible with respect to lnn. Both are built from VLMC (Variable Length Markov Chain)… (More)

Abstract. In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGRtree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the… (More)

The space requirements of an m-ary search tree satisfy a well-known phase transition: when m ≤ 26, the second order asymptotics is Gaussian. When m ≥ 27, it is not Gaussian any longer and a limit W of a complex-valued martingale arises. We show that the distribution of W has a square integrable density on the complex plane, that its support is the whole… (More)