Semi-Markov chains and hidden semi-Markov models toward applications Their use in reliability and DNA analysis, Lecture Notes in Statistics, vol.191, p.23, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00530330
Variable length Markov chains and dynamical sources, Lecture Notes in Math, vol.2046, issue.6, pp.1-39 ,
Persistent random walks, variable length markov chains and piecewise deterministic markov processes, Markov Processes and Related Fields, vol.19, issue.1 2, pp.1-50, 2013. ,
Recurrence of Multidimensional Persistent Random Walks. Fourier and Series Criteria. working paper or preprint, URL, 2017. ,
Persistent Random Walks. I. Recurrence Versus Transience, Journal of Theoretical Probability, vol.311, issue.3???4, pp.232-243, 2018. ,
DOI : 10.1016/S0378-4371(02)00805-1
Context tree estimation for not necessarily finite memory processes, via BIC and MDL, IEEE Transactions on Information Theory, vol.52, issue.3, pp.1007-1016, 2006. ,
DOI : 10.1109/TIT.2005.864431
Backward Coalescence Times for Perfect Simulation of Chains with Infinite Memory, Journal of Applied Probability, vol.9, issue.02, pp.319-337, 2012. ,
DOI : 10.1007/s11009-007-9041-7
Sur des cha??nesàcha??nescha??nesà liaisonscompì etes, Bull. Soc. Math. France, vol.65, issue.2, pp.132-148, 1937. ,
Persistent random walk of cells involving anomalous effects and random death, Physical Review E, vol.32, issue.4, p.42124, 2015. ,
DOI : 10.1103/PhysRevE.89.012107
URL : http://arxiv.org/pdf/1412.0535
Chains with complete connections: general theory, uniqueness, loss of memory and mixing properties, J. Stat. Phys, vol.118, pp.3-4555, 2005. ,
Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme, Advances in Applied Probability, vol.4, issue.03, pp.735-759, 2011. ,
DOI : 10.1214/aop/1176992367
URL : https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C8CA1D7B71C037856A7CC22BC23D9618/S0001867800005127a.pdf/div-class-title-chains-with-unbounded-variable-length-memory-perfect-simulation-and-a-visible-regeneration-scheme-div.pdf
Perfect simulation for locally continuous chains of infinite order, Stochastic Processes and their Applications, vol.123, issue.11, pp.3877-3902 ,
DOI : 10.1016/j.spa.2013.05.010
URL : http://arxiv.org/pdf/1103.2058
On non-regular g-measures, Nonlinearity, vol.2626763, issue.3, pp.763-776, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00732257
On chains of infinite orde, Pacific Journal of Mathematics, vol.5, issue.5, pp.707-724, 1955. ,
DOI : 10.2140/pjm.1955.5.707
URL : http://msp.org/pjm/1955/5-5/pjm-v5-n5-p10-s.pdf
Square summability of variations of g-functions and uniqueness of gmeasures, Math. Res. Lett, vol.10, issue.2, pp.5-6587, 2003. ,
Markov chains and stochastic stability, p.14, 2009. ,
A universal data compression system, IEEE Transactions on Information Theory, vol.29, issue.5, pp.656-664, 1983. ,
DOI : 10.1109/TIT.1983.1056741
Non-negative matrices and Markov chains; rev. version. Springer series in statistics, 1921. ,
DOI : 10.1007/0-387-32792-4
Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes, Bernoulli, vol.19, issue.3, p.846885, 2013. ,
DOI : 10.3150/12-BEJ468
The context-tree weighting method: extensions, IEEE Transactions on Information Theory, vol.44, issue.2, pp.792-798, 1998. ,
DOI : 10.1109/18.661523
URL : http://web.kuicr.kyoto-u.ac.jp/~vert/bibli/will.ps.gz
The context-tree weighting method: basic properties, IEEE Transactions on Information Theory, vol.41, issue.3, pp.653-664, 1995. ,
DOI : 10.1109/18.382012
URL : http://cs.haifa.ac.il/courses/src_coding/ContextTreeW-Basic.pdf