Optimal Controls that Maximize the Expectation of First Passage Time

1977 ◽  
Vol 304 (6) ◽  
pp. 231-242 ◽  
Author(s):  
Menahem Friedman ◽  
Yaakov Yavin
Keyword(s):  
First Passage Time ◽  
Passage Time ◽  
Optimal Controls ◽  
First Passage

First passage time for the state of exact chemical equilibrium

1980 ◽  
Vol 45 (3) ◽  
pp. 777-782 ◽  
Author(s):  
Milan Šolc
Keyword(s):  
Chemical Equilibrium ◽  
First Passage Time ◽  
Passage Time ◽  
The State ◽  
Recurrence Time ◽  
First Passage ◽  
First Order ◽  
The Mean ◽  
Passage Times ◽  
Number Of Particles

The establishment of chemical equilibrium in a system with a reversible first order reaction is characterized in terms of the distribution of first passage times for the state of exact chemical equilibrium. The mean first passage time of this state is a linear function of the logarithm of the total number of particles in the system. The equilibrium fluctuations of composition in the system are characterized by the distribution of the recurrence times for the state of exact chemical equilibrium. The mean recurrence time is inversely proportional to the square root of the total number of particles in the system.

scholarly journals Credit Gap Risk in a First Passage Time Model with Jumps

2009 ◽  
Author(s):  
Natalie Packham ◽  
Lutz Schloegl ◽  
Wolfgang M. Schmidt
Keyword(s):  
First Passage Time ◽  
Passage Time ◽  
First Passage ◽  
Time Model ◽  
Gap Risk ◽  
Credit Gap

Spectral Theory for Skip-Free Markov Chains

1989 ◽  
Vol 3 (1) ◽  
pp. 77-88 ◽  
Author(s):  
Joseph Abate ◽  
Ward Whitt
Keyword(s):  
Markov Chains ◽  
Spectral Theory ◽  
First Passage Time ◽  
Passage Time ◽  
First Passage Times ◽  
Simple Relationship ◽  
First Passage ◽  
Birth And Death Processes ◽  
The Laplace Transform ◽  
Passage Times

The distribution of upward first passage times in skip-free Markov chains can be expressed solely in terms of the eigenvalues in the spectral representation, without performing a separate calculation to determine the eigenvectors. We provide insight into this result and skip-free Markov chains more generally by showing that part of the spectral theory developed for birth-and-death processes extends to skip-free chains. We show that the eigenvalues and eigenvectors of skip-free chains can be characterized in terms of recursively defined polynomials. Moreover, the Laplace transform of the upward first passage time from 0 to n is the reciprocal of the nth polynomial. This simple relationship holds because the Laplace transforms of the first passage times satisfy the same recursion as the polynomials except for a normalization.

scholarly journals On the First Passage time for Brownian Motion Subordinated by a Lévy Process

2009 ◽  
Vol 46 (1) ◽  
pp. 181-198 ◽  
Author(s):  
T. R. Hurd ◽  
A. Kuznetsov
Keyword(s):  
Brownian Motion ◽  
Approximation Scheme ◽  
First Passage Time ◽  
Gaussian Model ◽  
Passage Time ◽  
Financial Mathematics ◽  
First Passage ◽  
Financial Modeling ◽  
Motion Time ◽  
Normal Inverse Gaussian

In this paper we consider the class of Lévy processes that can be written as a Brownian motion time changed by an independent Lévy subordinator. Examples in this class include the variance-gamma (VG) model, the normal-inverse Gaussian model, and other processes popular in financial modeling. The question addressed is the precise relation between the standard first passage time and an alternative notion, which we call the first passage of the second kind, as suggested by Hurd (2007) and others. We are able to prove that the standard first passage time is the almost-sure limit of iterations of the first passage of the second kind. Many different problems arising in financial mathematics are posed as first passage problems, and motivated by this fact, we are led to consider the implications of the approximation scheme for fast numerical methods for computing first passage. We find that the generic form of the iteration can be competitive with other numerical techniques. In the particular case of the VG model, the scheme can be further refined to give very fast algorithms.

Sign in / Sign up

Export Citation Format

Share Document