On First Range Times of Linear Diffusions
Paavo Salminen () and
Pierre Vallois ()
Additional contact information
Paavo Salminen: Åbo Akademi University
Pierre Vallois: Université Henri Poincaré
Journal of Theoretical Probability, 2005, vol. 18, issue 3, 567-593
Abstract:
Abstract In this paper we consider first range times (with randomised range level) of a linear diffusion on R. Inspired by the observation that the exponentially randomised range time has the same law as a similarly randomised first exit time from an interval, we study a large family of non-negative 2-dimensional random variables (X,X′) with this property. The defining feature of the family is F c (x,y)=F c (x+y,0), ∀ x ≥ 0, y ≥ 0, where F c (x,y):=P (X > x, X′ > y) We also explain the Markovian structure of the Brownian local time process when stopped at an exponentially randomised first range time. It is seen that squared Bessel processes with drift are serving hereby as a Markovian element.
Keywords: Bessel bridges; Bessel functions; Brownian motion; h-transforms; infimum; Ray–Knight theorem; supremum (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1007/s10959-005-3519-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:18:y:2005:i:3:d:10.1007_s10959-005-3519-4
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959
DOI: 10.1007/s10959-005-3519-4
Access Statistics for this article
Journal of Theoretical Probability is currently edited by Andrea Monica
More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().