SearcharxivSearch

arXiv · 1808.06433

On the almost decrease of a subexponential density

Abstract

For a subexponential density, so far, there has been no positive conclusion or counter example to show whether it is almost decreasing. In this paper, a subexponential density supported on $\mathbb{R}^+\cup\{0\}$ without the almost decrease is constructed by a little skillful method. The density is a positive piecewise linear function with a more normal shape. Correspondingly, there exists a local subexponential distribution which is not locally almost decreasing. Based on an example of Cline \cite{C1986}, some similar results are also obtained for the long-tailed density excluding the subexponential density and the local long-tailed distribution excluding the local subexponential distribution. Finally, the paper shows that, for the local subexponentiality of a distribution supported on $\mathbb{R}$, the local almost decreasing condition is necessary in some sense.

Explore related subjects

Keep this discovery

BibTeXRIS

Tao Jiang, Yuebao Wang, Zhaolei Cui. 2018-08-20. On the almost decrease of a subexponential density. https://arxiv.org/abs/1808.06433

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