SearcharxivSearch

arXiv · 1411.1214

Stochastic Modelling with Randomised Markov Bridges

Abstract

We consider the filtering problem of estimating a hidden random variable $X$ by noisy observations. The noisy observation process is constructed by a randomised Markov bridge (RMB) $(Z_t)_{t\in [0,T]}$ of which terminal value is set to $Z_T=X$. That is, at the terminal time $T$, the noise of the bridge process vanishes and the hidden random variable $X$ is revealed. We derive the explicit filtering formula, governing the dynamics of the conditional probability process, for a general RMB. It turns out that the conditional probability is given by a function of current time $t$, the current observation $Z_t$, the initial observation $Z_0$, and the a priori distribution $ν$ of $X$ at $t=0$. As an example for an RMB we explicitly construct the skew-normal randomised diffusion bridge and show how it can be utilised to extend well-known commodity pricing models and how one may propose novel stochastic price models for financial instruments linked to greenhouse gas emissions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrea Macrina, Jun Sekine. 2019-12-15. Stochastic Modelling with Randomised Markov Bridges. https://doi.org/10.1080/17442508.2019.1703988

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR