SearcharxivSearch

arXiv · math/0408267

Eigenvalue gaps for the Cauchy process and a Poincaré inequality

Abstract

A connection between the semigroup of the Cauchy process killed upon exiting a domain $D$ and a mixed boundary value problem for the Laplacian in one dimension higher known as the "mixed Steklov problem," was established in a previous paper of the authors. From this, a variational characterization for the eigenvalues $λ_n$, $n\geq 1$, of the Cauchy process in $D$ was obtained. In this paper we obtain a variational characterization of the difference between $λ_n$ and $λ_1$. We study bounded convex domains which are symmetric with respect to one of the coordinate axis and obtain lower bound estimates for $λ_* - λ_1$ where $λ_*$ is the eigenvalue corresponding to the "first" antisymmetric eigenfunction for $D$. The proof is based on a variational characterization of $λ_* - λ_1$ and on a weighted Poincaré--type inequality. The Poincaré inequality is valid for all $α$ symmetric stable processes, $0<α\leq 2$, and any other process obtained from Brownian motion by subordination. We also prove upper bound estimates for the spectral gap $λ_2-λ_1$ in bounded convex domains.

Explore related subjects

Keep this discovery

BibTeXRIS

Rodrigo Banuelos, Tadeusz Kulczycki. 2004-08-26. Eigenvalue gaps for the Cauchy process and a Poincaré inequality. https://arxiv.org/abs/math/0408267

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