Long runs under point conditioning. The real case.
Résumé
This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a functions of its summands as their number tends to innity. The conditioning event is of moderate or large deviation type. The result extends the Gibbs conditional principle in the sense that it provides a description of the distribution of the random walk on long subsequences. An algorithm for the simulation of such long runs is presented, together with an algorithm determining their maximal length for which the approximation is valid up to a prescribed accuracy.
Fichier principal
Long_runs_under_point_conditioning._The_real_case.pdf (970.43 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...