The Inverse First Passage time method for a two dimensional Ornstein Uhlenbeck process with neuronal application
A Civallero, C Zucca - arXiv preprint arXiv:1903.04927, 2019 - arxiv.org
The Inverse First Passage time problem seeks to determine the boundary corresponding to
a given stochastic process and a fixed first passage time distribution. Here, we determine the …
a given stochastic process and a fixed first passage time distribution. Here, we determine the …
[HTML][HTML] A first passage problem for a bivariate diffusion process: Numerical solution with an application to neuroscience when the process is Gauss–Markov
E Benedetto, L Sacerdote, C Zucca - Journal of computational and applied …, 2013 - Elsevier
We consider a bivariate Gauss–Markov process and we study the first passage time of one
component through a constant boundary. We prove that its probability density function is the …
component through a constant boundary. We prove that its probability density function is the …
A fast algorithm for the first-passage times of Gauss-Markov processes with Hölder continuous boundaries
T Taillefumier, MO Magnasco - Journal of Statistical Physics, 2010 - Springer
Even for simple diffusion processes, treating first-passage problems analytically proves
intractable for generic barriers and existing numerical methods are inaccurate and …
intractable for generic barriers and existing numerical methods are inaccurate and …
Approximation of exit times for one-dimensional linear and growth diffusion processes
S Herrmann, N Massin - arXiv preprint arXiv:1906.02969, 2019 - arxiv.org
In order to approximate the exit time of a one-dimensional diffusion process, we propose an
algorithm based on a random walk. Such an algorithm was already introduced in both the …
algorithm based on a random walk. Such an algorithm was already introduced in both the …
First passage time problems and some related computational methods
L Favella, MT Reineri, LM Ricciardi… - Cybernetics and …, 1982 - Taylor & Francis
Motivated by the interest of first passage time problems in neurobiology and in a variety of
applied fields, we study the solution of first passage time equations for the Wiener and the …
applied fields, we study the solution of first passage time equations for the Wiener and the …
Conditions for existence and uniqueness of the inverse first-passage time problem applicable for L\'evy processes and diffusions
For a stochastic process $(X_t) _ {t\geq 0} $ we establish conditions under which the inverse
first-passage time problem has a solution for any random variable $\xi> 0$. For Markov …
first-passage time problem has a solution for any random variable $\xi> 0$. For Markov …
Reconstruction of a persistent random walk from exit time distributions
In this paper, we study the inverse problem of reconstructing the spatially dependent
transition rate F (x) of a 1D Broadwell process from exit time distributions. In such a process …
transition rate F (x) of a 1D Broadwell process from exit time distributions. In such a process …
On time non-homogeneous Feller-type diffusion process in neuronal modeling
Time non-homogeneous Feller-type and Ornstein-Uhlenbeck diffusion processes are
considered for modeling the neuronal activity in the presence of time-varying input signals …
considered for modeling the neuronal activity in the presence of time-varying input signals …
Explicit asymptotics on first passage times of diffusion processes
A Dassios, L Li - Advances in Applied Probability, 2020 - cambridge.org
We introduce a unified framework for solving first passage times of time-homogeneous
diffusion processes. Using potential theory and perturbation theory, we are able to deduce …
diffusion processes. Using potential theory and perturbation theory, we are able to deduce …
Exit problem for Ornstein-Uhlenbeck processes: a random walk approach
S Herrmann, N Massin - arXiv preprint arXiv:1906.01255, 2019 - arxiv.org
In order to approximate the exit time of a one-dimensional diffusion process, we propose an
algorithm based on a random walk. Such an algorithm so-called Walk on Moving Spheres …
algorithm based on a random walk. Such an algorithm so-called Walk on Moving Spheres …