Dynamic construction of martingales of density functions

Shiqi Song

Home/Archive/arXiv

arXiv · 1401.6909

Dynamic construction of martingales of density functions

Shiqi Song

View original source ↗Read source document ↗Export metadata ↓

Abstract

The density hypothesis on random times becomes now a standard in modeling of risks. One of the basic reasons to introduce the density hypothesis is the desire to have a computable credit risk model. However, recent work shows that merely an existence of a density function for the conditional law of the random times will not be enough for the purposes of some numerical implantation problems. It becomes necessary to have models with martingales of density functions evolving along with the development of the information flow, in particular, to have Markovian martingales of density functions determined by a stochastic differential equation. The quetion of constructing a martingale of density functions by a stochastic differential equation has been answered in one dimensional case. The aim of this note is to provide a solution in higher dimensional cases.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Shiqi Song. 2014-02-02. Dynamic construction of martingales of density functions. https://arxiv.org/abs/1401.6909

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗