Efficient Low-Order Approximation of First-Passage Time Distributions
We consider the problem of computing first-passage time distributions for reaction processes modelled by master equations. We show that this generally intractable class of problems is equivalent to a sequential Bayesian inference problem for an auxiliary observation process. The solution can be approximated efficiently by solving a closed set of coupled ordinary differential equations (for the low-order moments of the process) whose size scales with the number of species. We apply it to an epidemic model and a trimerisation process, and show good agreement with stochastic simulations.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian InferenceSequential Bayesian InferenceSimilar Papers 제목 키워드 기반
Matched transient and steady-state approximation of first-passage-time distributions of coloured noise driven leaky neurons
The first-passage-time distribution of a leaky integrate-and-fire neuron driven by a characteristically coloured noise is approximated by matching a transient and a steady-state solution of the membrane voltage distribut…
First Passage Time for Tempered Stable Process and Its Application to Perpetual American Option and Barrier Option Pricing
In this paper, we will discuss an approximation of the characteristic function of the first passage time for a Levy process using the martingale approach. The characteristic function of the first passage time of the temp…
Tractable Representations for Convergent Approximation of Distributional HJB Equations
In reinforcement learning (RL), the long-term behavior of decision-making policies is evaluated based on their average returns. Distributional RL has emerged, presenting techniques for learning return distributions, whic…
Reinforcement Learning (RL)Exact analytic expressions for discrete first-passage time probability distributions in Markov networks
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (t…
A General Approach for Lookback Option Pricing under Markov Models
We propose a very efficient method for pricing various types of lookback options under Markov models. We utilize the model-free representations of lookback option prices as integrals of first passage probabilities. We co…