The First-passage Time of the Brownian Motion to a Curved Boundary: an Algorithmic Approach
From MaRDI portal
Publication:3464423
DOI10.1137/151006172zbMath1334.60062arXiv1501.07060OpenAlexW2123167211WikidataQ60920715 ScholiaQ60920715MaRDI QIDQ3464423
Samuel Herrmann, Etienne Tanré
Publication date: 27 January 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07060
Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (7)
With or without replacement? Sampling uncertainty in Shepp’s urn scheme ⋮ The inverse first-passage time problem as hydrodynamic limit of a particle system ⋮ First hitting time distributions for Brownian motion and regions with piecewise linear boundaries ⋮ Vanishing corrections for the position in a linear model of FKPP fronts ⋮ Simulation of sample paths for Gauss-Markov processes in the presence of a reflecting boundary ⋮ Exact simulation of the first-passage time of diffusions ⋮ Existence and regularity of law density of a pair (diffusion, first component running maximum)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematical foundations of neuroscience
- Boundary crossing of Brownian motion. Its relation to the law of the iterated logarithm and to sequential analysis
- Diffusion approximation and first-passage-time problem for a model neuron. III: A birth-and-death process approach
- Stochastic differential equations for compounded risk reserves
- First passage time to detection in stochastic population dynamical models for HIV-1
- A Monte Carlo method for the simulation of first passage times of diffusion processes
- Asymptotics of hitting probabilities for general one-dimensional pinned diffusions
- Weak approximation of killed diffusion using Euler schemes.
- On the comparison of Feller and Ornstein-Uhlenbeck models for neural activity
- Fokker-Planck and Fortet equation-based parameter estimation for a leaky integrate-and-fire model with sinusoidal and stochastic forcing
- Stopped diffusion processes: boundary corrections and overshoot
- A review of the integrate-and-fire neuron model: I. Homogeneous synaptic input
- Large deviation approaches for the numerical computation of the hitting probability for Gaussian processes
- Crossing probabilities for diffusion processes with piecewise continuous boundaries
- A Continuity Correction for Discrete Barrier Options
- A computational approach to first-passage-time problems for Gauss–Markov processes
- Efficient Estimation of One-Dimensional Diffusion First Passage Time Densities via Monte Carlo Simulation
- Some Continuous Monte Carlo Methods for the Dirichlet Problem
- On an integral equation for first-passage-time probability densities
- The first-passage density of a continuous gaussian process to a general boundary
- A new integral equation for the evaluation of first-passage-time probability densities
- On the evaluation of first-passage-time probability densities via non-singular integral equations
- An asymptotic expansion for one-sided Brownian exit densities
- The tangent approximation to one-sided Brownian exit densities
- The first-passage density of the Brownian motion process to a curved boundary
- Generating Random Variates Using Transformations with Multiple Roots
- The maximum size of a closed epidemic
- Pricing Barrier Options with Time–Dependent Coefficients
- An improved technique for the simulation of first passage times for diffusion processes
- System reliability based on diffusion models for fatigue crack growth
- Spiking Neuron Models
- On evaluations and asymptotic approximations of first-passage-time probabilities
- Explicit Bounds for Approximation Rates of Boundary Crossing Probabilities for the Wiener Process
- Level-crossing problems for random processes
This page was built for publication: The First-passage Time of the Brownian Motion to a Curved Boundary: an Algorithmic Approach