Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Pouyanne, Nicolas"'
Variable Length Memory Chains (VLMC), which are generalizations of finite order Markov chains, turn out to be an essential tool to modelize random sequences in many domains, as well as an interesting object in contemporary probability theory. The que
Externí odkaz:
http://arxiv.org/abs/2004.07893
By introducing a key combinatorial structure for words produced by a Variable Length Markov Chain (VLMC), the longest internal suffix, precise characterizations of existence and uniqueness of a stationary probability measure for a VLMC chain are give
Externí odkaz:
http://arxiv.org/abs/1807.01075
Autor:
Janson, Svante, Pouyanne, Nicolas
It is known that in an irreducible small P\'olya urn process, the composition of the urn after suitable normalization converges in distribution to a normal distribution. We show that if the urn also is balanced, this normal convergence holds with con
Externí odkaz:
http://arxiv.org/abs/1606.07022
Autor:
Pouyanne, Nicolas
Ce travail est la synthèse de travaux de recherches en mathématiques, dont les thèmes sont empruntés à la géométrie algébrique, la combinatoire analytique et les probabilités. La première partie concerne les variétés algébriques complexe
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00403659
http://tel.archives-ouvertes.fr/docs/00/40/37/74/PDF/habilitation.pdf
http://tel.archives-ouvertes.fr/docs/00/40/37/74/PDF/habilitation.pdf
The fringe of a B-tree with parameter $m$ is considered as a particular P\'olya urn with $m$ colors. More precisely, the asymptotic behaviour of this fringe, when the number of stored keys tends to infinity, is studied through the composition vector
Externí odkaz:
http://arxiv.org/abs/1408.2069
Consider a balanced non triangular two-color P\'olya-Eggenberger urn process, assumed to be large which means that the ratio sigma of the replacement matrix eigenvalues satisfies 1/2
Externí odkaz:
http://arxiv.org/abs/1302.1412
The space requirements of an $m$-ary search tree satisfies a well-known phase transition: when $m\leq 26$, the second order asymptotics is Gaussian. When $m\geq 27$, it is not Gaussian any longer and a limit $W$ of a complex-valued martingale arises.
Externí odkaz:
http://arxiv.org/abs/1201.4098
Common assumptions on the source producing the words inserted in a suffix trie with $n$ leaves lead to a $\log n$ height and saturation level. We provide an example of a suffix trie whose height increases faster than a power of $n$ and another one wh
Externí odkaz:
http://arxiv.org/abs/1112.4131
A particular continuous-time multitype branching process is considered, it is the continuous-time embedding of a discrete-time process which is very popular in theoretical computer science: the m-ary search tree (m is an integer). There is a well-kno
Externí odkaz:
http://arxiv.org/abs/1112.0256
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 studi
Externí odkaz:
http://arxiv.org/abs/1007.2986