Search results for "Probability"

showing 10 items of 3417 documents

PARAMETER ESTIMATION FOR FRACTIONAL ORNSTEIN-UHLENBECK PROCESSES: NON-ERGODIC CASE

2011

We consider the parameter estimation problem for the non-ergodic fractional Ornstein-Uhlenbeck process defined as $dX_t=\theta X_tdt+dB_t,\ t\geq0$, with a parameter $\theta>0$, where $B$ is a fractional Brownian motion of Hurst index $H\in(1/2,1)$. We study the consistency and the asymptotic distributions of the least squares estimator $\hat{\theta}_t$ of $\theta$ based on the observation $\{X_s,\ s\in[0,t]\}$ as $t\rightarrow\infty$.

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Probability (math.PR)62F12 60G18 60G1562F12 60G18 60G15.[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Mathematics::ProbabilityFOS: MathematicsParameter estimationYoung integralYoung integral.Parameter estimation; Non-ergodic fractional Ornstein-Uhlenbeck process; Young integral.[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityNon-ergodic fractional Ornstein-Uhlenbeck process
researchProduct

Exact simulation of diffusion first exit times: algorithm acceleration

2020

In order to describe or estimate different quantities related to a specific random variable, it is of prime interest to numerically generate such a variate. In specific situations, the exact generation of random variables might be either momentarily unavailable or too expensive in terms of computation time. It therefore needs to be replaced by an approximation procedure. As was previously the case, the ambitious exact simulation of exit times for diffusion processes was unreachable though it concerns many applications in different fields like mathematical finance, neuroscience or reliability. The usual way to describe exit times was to use discretization schemes, that are of course approxim…

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Probability (math.PR)primary 65C05 secondary:60G40 68W20 68T05 65C20 91A60 60J60diffusion processes[MATH] Mathematics [math]Exit timeExit time Brownian motion diffusion processes rejection sampling exact simulation multi-armed bandit randomized algorithm.randomized algorithm[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]exact simulationFOS: MathematicsBrownian motionmulti-armed banditMathematics - ProbabilityRejection sampling
researchProduct

Variable Length Markov Chains, Persistent Random Walks: a close encounter

2020

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-Markov property of underlying processes.

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Property (philosophy)Markov chain010102 general mathematicsProbability (math.PR)Close encounterVariable lengthRandom walk01 natural sciences[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]010104 statistics & probabilityFOS: MathematicsPoint (geometry)Statistical physics0101 mathematicsMathematics - ProbabilityMathematics
researchProduct

Statistical consequences of the Devroye inequality for processes. Applications to a class of non-uniformly hyperbolic dynamical systems

2005

In this paper, we apply Devroye inequality to study various statistical estimators and fluctuations of observables for processes. Most of these observables are suggested by dynamical systems. These applications concern the co-variance function, the integrated periodogram, the correlation dimension, the kernel density estimator, the speed of convergence of empirical measure, the shadowing property and the almost-sure central limit theorem. We proved in \cite{CCS} that Devroye inequality holds for a class of non-uniformly hyperbolic dynamical systems introduced in \cite{young}. In the second appendix we prove that, if the decay of correlations holds with a common rate for all pairs of functio…

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Pure mathematicsDynamical systems theoryFunction space[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS][MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS]General Physics and AstronomyDynamical Systems (math.DS)01 natural sciences010104 statistics & probabilityFOS: MathematicsMathematics - Dynamical Systems0101 mathematicsMathematical PhysicsCentral limit theoremMathematicsApplied MathematicsProbability (math.PR)010102 general mathematicsEstimatorStatistical and Nonlinear PhysicsFunction (mathematics)Absolute continuity[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Besov spaceInvariant measure[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityNonlinearity
researchProduct

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…

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Variable length Markov chainProbability (math.PR)Semi Markov processesIntegrated telegraph noise[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Mathematics::ProbabilitySimple and double infinite combs.Variable memoryFOS: Mathematics[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityPersistent random walkSimple and double infinite combsPiecewise Deterministic Markov Processes
researchProduct

The central limit theorem for linear eigenvalue statistics of the sum of independent random matrices of rank one

2014

International audience

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]010104 statistics & probability[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]010102 general mathematics[MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA]0101 mathematics16. Peace & justice[MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA]01 natural sciencesComputingMilieux_MISCELLANEOUS
researchProduct

Additive functionals and push forward measures under Veretennikov's flow

2014

16 pages; In this work, we will be interested in the push forward measure $(\vf_t)_*\gamma$, where $\vf_t$ is defined by the stochastic differential equation \begin{equation*} d\vf_t(x)=dW_t + \ba(\vf_t(x))dt, \quad \vf_0(x)=x\in\mbR^m, \end{equation*} and $\gamma$ is the standard Gaussian measure. We will prove the existence of density under the hypothesis that the divergence $\div(\ba)$ is not a function, but a signed measure belonging to a Kato class; the density will be expressed with help of the additive functional associated to $\div(\ba)$.

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]010104 statistics & probability[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]010102 general mathematicsstochastic flowsAdditive functionalsmeasures in Kato class0101 mathematics01 natural sciencesAMS 2000 subject classifications. Primary 60H10; secondary 60J35 60J60.[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]
researchProduct

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 …

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]60J80[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Bifurcating Markov chains[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]binary trees[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 62G0560F10
researchProduct

Quantiles de régression : applications à la construction de courbes de référence

2006

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][ SHS.ECO ] Humanities and Social Sciences/Economies and finances[SHS.ECO] Humanities and Social Sciences/Economics and Finance[SHS.ECO]Humanities and Social Sciences/Economics and Finance
researchProduct

Characterization of stationary probability measures for Variable Length Markov Chains

2020

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 given. These characterizations turn into necessary and sufficient conditions for VLMC associated to a subclass of probabilised context trees: the shift-stable context trees. As a by-product, we prove that a VLMC chain whose stabilized context tree is again a context tree has at most one stationary probability measure.

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]60J05 60C05 60G10Probability (math.PR)FOS: MathematicsMathematics - Probability
researchProduct