• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Linear and non-linear boundary crossing probabilities for Brownian motion and related processes

Wu, Tung-Lung Jr 12 1900 (has links)
We propose a simple and general method to obtain the boundary crossing probability for Brownian motion. This method can be easily extended to higher dimensional of Brownian motion. It also covers certain classes of stochastic processes associated with Brownian motion. The basic idea of the method is based on being able to construct a nite Markov chain such that the boundary crossing probability of Brownian motion is obtained as the limiting probability of the nite Markov chain entering a set of absorbing states induced by the boundary. Numerical results are given to illustrate our method.
2

Linear and non-linear boundary crossing probabilities for Brownian motion and related processes

Wu, Tung-Lung Jr 12 1900 (has links)
We propose a simple and general method to obtain the boundary crossing probability for Brownian motion. This method can be easily extended to higher dimensional of Brownian motion. It also covers certain classes of stochastic processes associated with Brownian motion. The basic idea of the method is based on being able to construct a nite Markov chain such that the boundary crossing probability of Brownian motion is obtained as the limiting probability of the nite Markov chain entering a set of absorbing states induced by the boundary. Numerical results are given to illustrate our method.

Page generated in 0.0759 seconds