Search arXivSearch

arXiv · 1310.1901

Differentiablity of excessive functions of one-dimensional diffusions and the principle of smooth fit

Abstract

The principle of smooth fit is probably the most used tool to find solutions to optimal stopping problems of one-dimensional diffusions. It is important, e.g., in financial mathematical applications to understand in which kind of models and problems smooth fit can fail. In this paper we connect - in case of one-dimensional diffusions - the validity of smooth fit and the differentiability of excessive functions. The basic tool to derive the results is the representation theory of excessive functions; in particular, the Riesz and Martin representations. It is seen that the differentiability may not hold in case the speed measure of the diffusion or the representing measure of the excessive function has atoms. As an example, we study optimal stopping of sticky Brownian motion. It is known that the validity of the smooth fit in this case depends on the value of the discounting parameter (when the other parameters are fixed). We decompose the size of the jump in the derivative of the value function in two factors. The first one is due to the atom of the representing measure and the second one due to the atom of the speed measure.

Explore related subjects

Keep this discovery

BibTeXRIS

Paavo Salminen, Bao Quoc Ta. 2014-06-23. Differentiablity of excessive functions of one-dimensional diffusions and the principle of smooth fit. https://arxiv.org/abs/1310.1901

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