SearcharxivSearch

arXiv · 1501.03233

Criteria for Discrete Spectrum of 1D Operators

Abstract

For discrete spectrum of 1D second-order differential/difference operators (with or without potential (killing), with the maximal/minimal domain), a pair of unified dual criteria are presented in terms of two explicit measures and the harmonic function of the operators. Interes\-tingly, these criteria can be read out from the ones for the exponential convergence of four types of stability studied earlier, simply replacing the `finite supremum' by `vanishing at infinity'. Except a dual technique, the main tool used here is a transform in terms of the harmonic function, to which two new practical algorithms are introduced in the discrete context and two successive approximation schemes are reviewed in the continuous context. All of them are illustrated by examples. The main body of the paper is devoted to the hard part of the story, the easier part but powerful one is delayed to the end of the paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Mu-Fa Chen. 2015-01-14. Criteria for Discrete Spectrum of 1D Operators. https://arxiv.org/abs/1501.03233

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