Conservative bounds in a certain first-passage-problem - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Conservative bounds in a certain first-passage-problem

Résumé

The goal is to calculate the probability that a discrete time autoregressive process (scalar or vector) leaves a given interval (domain) at least once during a certain period T. The distributions of the innovation process and the initial state are unknown but some special bounds for the cumulative distribution functions and/or for the probability density functions are available. Numerical methods to calculate the conservative bounds for the above-mentioned probability are considered. Such bounds can be useful in sequential change detection problem and also for risk estimation in some safety-critical applications.
Fichier non déposé

Dates et versions

hal-02884112 , version 1 (29-06-2020)

Identifiants

  • HAL Id : hal-02884112 , version 1

Citer

Igor V. Nikiforov. Conservative bounds in a certain first-passage-problem. 9th International Workshop on Applied Probability (IWAP 2018), Jun 2018, Budapest, Hungary. ⟨hal-02884112⟩
19 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More