SearcharxivSearch

arXiv · 1806.02912

Affine processes under parameter uncertainty

Abstract

We develop a one-dimensional notion of affine processes under parameter uncertainty, which we call non-linear affine processes. This is done as follows: given a set of parameters for the process, we construct a corresponding non-linear expectation on the path space of continuous processes. By a general dynamic programming principle we link this non-linear expectation to a variational form of the Kolmogorov equation, where the generator of a single affine process is replaced by the supremum over all corresponding generators of affine processes with parameters in the parameter set. This non-linear affine process yields a tractable model for Knightian uncertainty, especially for modelling interest rates under ambiguity. We then develop an appropriate Ito-formula, the respective term-structure equations and study the non-linear versions of the Vasicek and the Cox-Ingersoll-Ross (CIR) model. Thereafter we introduce the non-linear Vasicek-CIR model. This model is particularly suitable for modelling interest rates when one does not want to restrict the state space a priori and hence the approach solves this modelling issue arising with negative interest rates.

Explore related subjects

Keep this discovery

BibTeXRIS

Tolulope Fadina, Ariel Neufeld, Thorsten Schmidt. 2019-03-26. Affine processes under parameter uncertainty. https://arxiv.org/abs/1806.02912

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