Displaying similar documents to “Occupation time sets of supports of continuous additive functionals”

Additive functionals of Markov processes and stochastic systems

Evgeny B. Dynkin (1975)

Annales de l'institut Fourier

Similarity:

Intuitively, an additive functional of a stochastic process ( x t , P ) gives a method to measure time taking into account the development of the process. We associate with any set of states C the mathematical expectation of time x t belongs to C . In this way, we establish to one-to-one correspondence between all the normal additive functionals of a Markov process and all the δ -finite measures on the state space which charge no inaccessible set. This is proved under the condition that transition...

On the large deviations of a class of modulated additive processes

Ken R. Duffy, Claudio Macci, Giovanni Luca Torrisi (2011)

ESAIM: Probability and Statistics

Similarity:

We prove that the large deviation principle holds for a class of processes inspired by semi-Markov additive processes. For the processes we consider, the sojourn times in the phase process need not be independent and identically distributed. Moreover the state selection process need not be independent of the sojourn times. We assume that the phase process takes values in a finite set and that the order in which elements in the set, called states, are visited is selected stochastically....

On the large deviations of a class of modulated additive processes

Ken R. Duffy, Claudio Macci, Giovanni Luca Torrisi (2012)

ESAIM: Probability and Statistics

Similarity:

We prove that the large deviation principle holds for a class of processes inspired by semi-Markov additive processes. For the processes we consider, the sojourn times in the phase process need not be independent and identically distributed. Moreover the state selection process need not be independent of the sojourn times. We assume that the phase process takes values in a finite set and that the order in which elements in the set, called states, are visited is selected stochastically....