Displaying 2341 – 2360 of 10055

Showing per page

Deviation bounds for additive functionals of Markov processes

Patrick Cattiaux, Arnaud Guillin (2008)

ESAIM: Probability and Statistics

In this paper we derive non asymptotic deviation bounds for ν ( | 1 t 0 t V ( X s ) d s - V d μ | R ) where X is a μ stationary and ergodic Markov process and V is some μ integrable function. These bounds are obtained under various moments assumptions for V , and various regularity assumptions for μ . Regularity means here that μ may satisfy various functional inequalities (F-Sobolev, generalized Poincaré etc.).

deviation bounds for additive functionals of markov processes

Patrick Cattiaux, Arnaud Guillin (2007)

ESAIM: Probability and Statistics

In this paper we derive non asymptotic deviation bounds for ν ( | 1 t 0 t V ( X s ) d s - V d μ | R ) where X is a μ stationary and ergodic Markov process and V is some μ integrable function. These bounds are obtained under various moments assumptions for V, and various regularity assumptions for μ. Regularity means here that μ may satisfy various functional inequalities (F-Sobolev, generalized Poincaré etc.).

Deviation inequalities and moderate deviations for estimators of parameters in bifurcating autoregressive models

S. Valère Bitseki Penda, Hacène Djellout (2014)

Annales de l'I.H.P. Probabilités et statistiques

The purpose of this paper is to investigate the deviation inequalities and the moderate deviation principle of the least squares estimators of the unknown parameters of general p th-order asymmetric bifurcating autoregressive processes, under suitable assumptions on the driven noise of the process. Our investigation relies on the moderate deviation principle for martingales.

Didactical note: probabilistic conditionality in a Boolean algebra.

Enric Trillas, Claudi Alsina, Settimo Termini (1996)

Mathware and Soft Computing

This note deals with two logical topics and concerns Boolean Algebras from an elementary point of view. First we consider the class of operations on a Boolean Algebra that can be used for modelling If-then propositions. These operations, or Conditionals, are characterized under the hypothesis that they only obey to the Modus Ponens-Inequality, and it is shown that only six of them are boolean two-place functions. Is the Conditional Probability the Probability of a Conditional? This problem will...

Currently displaying 2341 – 2360 of 10055