SearcharxivSearch

arXiv · 1711.00908

Feynman-Kac formula for the stochastic Bessel operator

Abstract

We introduce a stochastic process and functional that should describe the semigroup generated by the stochastic Bessel operator. Recently Gorin and Shkolnikov showed that the largest eigenvalues for certain random matrix ensembles with soft edge behavior can be understood by analyzing large powers of tridiagonal matrices, which converge to operators in the stochastic Airy semigroup. In this article we make some progress towards realizing Gorin and Shkolnikov's program at the random matrix hard edge. We analyze large powers of a suitable tridiagonal matrix model (a slight modification of the $\beta$-Laguerre ensemble). For finite $n$ we represent the matrix powers using Feynman-Kac type formulas, which identifies a sequence of stochastic processes $X^n$ and functionals $\Phi_n$. We show that $\Phi_n(X^n)$ converges in probability to the limiting functional $\Phi(X)$ for our proposed stochastic Bessel semigroup. We also discuss how the semigroup method may be used to understand transitions from a hard edge to a soft edge in the $\beta$-Laguerre models.

Explore related subjects

Keep this discovery

BibTeXRIS

Patrick Waters. 2017-11-02. Feynman-Kac formula for the stochastic Bessel operator. https://arxiv.org/abs/1711.00908

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