40 citations · 72 across the 10 of their papers we have counts for
12 papers
Variable Length Memory Chains: characterization of stationary probability measures
Peggy Cénac, Brigitte Chauvin, Camille Noûs +2
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 wel…
Variable Length Markov Chains, Persistent Random Walks: a close encounter
P. Cénac, B. Chauvin, F. Paccaut +1
This is the story of the encounter between two worlds: the world of random walks and the world of Variable Length Markov Chains (VLMC). The meeting point turns around the semi-Mark…
Characterization of stationary probability measures for Variable Length Markov Chains
Peggy Cénac, Brigitte Chauvin, Frédéric Paccaut +1
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 un…
Smoothing equations for large Pólya urns
Brigitte Chauvin, Cécile Mailler, Nicolas Pouyanne
Consider a balanced non triangular two-color Pólya-Eggenberger urn process, assumed to be large which means that the ratio sigma of the replacement matrix eigenvalues satisfies 1/2…
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes
Peggy Cénac, Brigitte Chauvin, Samuel Herrmann +1
A classical random walk is defined by , where are i.i.d. When the increments are a one-…
Support and density of the limit -ary search trees distribution
Brigitte Chauvin, Quansheng Liu, Nicolas Pouyanne
The space requirements of an -ary search tree satisfies a well-known phase transition: when , the second order asymptotics is Gaussian. When , it is not Gaus…