Search results for "Markov"
showing 10 items of 628 documents
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *
2013
A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…
MODERATE DEVIATION PRINCIPLES FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS
2021
Bitseki and Delmas (2021) have studied recently the central limit theorem for kernel estimator of invariant density in bifurcating Markov chains models. We complete their work by proving a moderate deviation principle for this estimator. Unlike the work of Bitseki and Gorgui (2021), it is interesting to see that the distinction of the two regimes disappears and that we are able to get moderate deviation principle for large values of the ergodic rate. It is also interesting and surprising to see that for moderate deviation principle, the ergodic rate begins to have an impact on the choice of the bandwidth for values smaller than in the context of central limit theorem studied by Bitseki and …
CENTRAL LIMIT THEOREM FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS
2021
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the invariant probability measure which appears as the asymptotic distribution of the trait, we prove the consistence and the Gaussian fluctuations for a kernel estimator of this density based on late generations. In this setting, it is interesting to note that the distinction of the three regimes on the ergodic rate identified in a previous work (for fluctuations of average over large generations) disappears. This result is a first step to go beyond the thresh…
CENTRAL LIMIT THEOREM FOR BIFURCATING MARKOV CHAINS
2020
Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We first provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (2007), where the considered additive functionals are sums of martingale increments, and only one regime appears. Our first result can be seen as a discrete time version, but with general trait evoluti…
Weeds sampling for map reconstruction: a Markov random field approach
2012
In the past 15 years, there has been a growing interest for the study of the spatial repartition of weeds in crops, mainly because this is a prerequisite to herbicides use reduction. There has been a large variety of statistical methods developped for this problem ([5], [7], [10]). However, one common point of all of these methods is that they are based on in situ collection of data about weeds spatial repartition. A crucial problem is then to choose where, in the eld, data should be collected. Since exhaustive sampling of a eld is too costly, a lot of attention has been paid to the development of spatial sampling methods ([12], [4], [6] [9]). Classical spatial stochastic model of weeds cou…
Système de prise d'images haute résolution pour l'analyse de projection de particules : application à l'épandage centrifuge d'engrais
2002
This paper describes the design of a high resolution low cost imaging system for the analysis of high speed particle projection. This system, based on a camera and a set of flashes, is used to characterize the centrifugal spreading of fertilizer particles ejected at speeds of environ 30 m s. Multiexposure images collected with the camera installed perpendicular to the output flow of granules are analysed to estimate the trajectories of the fertilizer granules. Very good results are obtained with the Markov random fields method, in comparison with others.
Dynamique et assemblage des communautés adventices : Approche par modélisation statistique
2011
To develop solutions for a productive and sustainable agriculture, principles, theories, andmethods of ecology may contribute to understand the biological processes governing the agroecosystem.The present case study was based on data collected by a network of observatories of weeds covering the whole of France (‘Biovigilance Flore’) and aimed at establishing forrules governing the assemblage and dynamics of weed communities in fields grown with annual crops. We particularly studied the possible relationships between species within acommunity, as well as the relationships between communities and their environment. Analyses were based on species abundances to take account of their effect on c…
Échantillonnage adaptatif optimal dans les champs de Markov, application à l’échantillonnage d’une espèce adventice
2012
This work is divided into two parts: (i) the theoretical study of the problem of adaptive sampling in Markov Random Fields (MRF) and (ii) the modeling of the problem of weed sampling in a crop field and the design of adaptive sampling strategies for this problem. For the first point, we first modeled the problem of finding an optimal sampling strategy as a finite horizon Markov Decision Process (MDP). Then, we proposed a generic algorithm for computing an approximate solution to any finite horizon MDP with known model. This algorithm, called Least-Squared Dynamic Programming (LSDP), combines the concepts of dynamic programming and reinforcement learning. It was then adapted to compute adapt…
Modeling temporal dominance of sensations data with stochastic processes
2018
National audience