To establish lists of words with unexpected frequencies in long sequences, for instance in a molecular biology context, one needs to quantify the exceptionality of families of word frequencies in random sequences. To this aim, we study large deviation probabilities of multidimensional word counts for Markov and hidden Markov models. More specifically, we compute local Edgeworth expansions of arbitrary degrees for multivariate partial sums of lattice valued functionals of finite Markov chains. This yields sharp approximations of the associated large deviation probabilities. We also provide detailed simulations. These exhibit in particular previously unreported periodic oscillations, for which we provide theoretical explanation...
We study the fraction of time that a Markov chain spends in a given subset of states. We give an exp...
We study large deviations principles for N random processes on the lattice ℤd with finite time horiz...
We describe a simple form of importance sampling designed to bound and compute large-deviation rate ...
To establish lists of words with unexpected frequencies in long sequences, for instance in a molec...
Abstract. To establish lists of words with unexpected frequencies in long sequences, for instance in...
To establish lists of words with unexpected frequencies in random sequences, for instance in a molec...
International audienceIn this paper, me give an overview about the different results existing on the...
Deciding whether a given pattern is overrepresented or under-represented according to a given backgr...
International audiencen the following, an overview is given on statistical and probabilistic propert...
We consider discrete-time Markov chains and study large deviations of the pair empirical occupation ...
The paper examines multiplicative ergodic theorems and the related multiplicative Poisson equation f...
The observation of an ergodic Markov chain asymptotically allows perfect identification of the trans...
ABSTRACT. Generalized Zeckendorf decompositions are expansions of integers as sums of ele-ments of s...
The observation of an ergodic Markov chain asymptotically allows perfect identification of the trans...
Word match counts have traditionally been proposed as an alignment-free measure of similarity for bi...
We study the fraction of time that a Markov chain spends in a given subset of states. We give an exp...
We study large deviations principles for N random processes on the lattice ℤd with finite time horiz...
We describe a simple form of importance sampling designed to bound and compute large-deviation rate ...
To establish lists of words with unexpected frequencies in long sequences, for instance in a molec...
Abstract. To establish lists of words with unexpected frequencies in long sequences, for instance in...
To establish lists of words with unexpected frequencies in random sequences, for instance in a molec...
International audienceIn this paper, me give an overview about the different results existing on the...
Deciding whether a given pattern is overrepresented or under-represented according to a given backgr...
International audiencen the following, an overview is given on statistical and probabilistic propert...
We consider discrete-time Markov chains and study large deviations of the pair empirical occupation ...
The paper examines multiplicative ergodic theorems and the related multiplicative Poisson equation f...
The observation of an ergodic Markov chain asymptotically allows perfect identification of the trans...
ABSTRACT. Generalized Zeckendorf decompositions are expansions of integers as sums of ele-ments of s...
The observation of an ergodic Markov chain asymptotically allows perfect identification of the trans...
Word match counts have traditionally been proposed as an alignment-free measure of similarity for bi...
We study the fraction of time that a Markov chain spends in a given subset of states. We give an exp...
We study large deviations principles for N random processes on the lattice ℤd with finite time horiz...
We describe a simple form of importance sampling designed to bound and compute large-deviation rate ...