SearcharxivSearch

arXiv · 1802.04988

The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace

Abstract

This paper is devoted to the Depoissonnisation process, which is central in various analyses of the AofA domain. We first recall the two possible paths that may be used in this process. The first path, called here the Depoissonisation path, is better studied and is proven to apply in any practical situation; however, it often uses technical tools, that are not so easy to deal with. Moreover, the various results are scattered in the litterature, and the most recent results are not well known within the AofA domain. The present paper gathers in Section 2 all these results in a survey style. The second path, called here the Rice-Mellin path, is less often used within the AofA domain. It is often very easy to apply, but it needs a tameness condition, which appears {\em a priori} to be quite restrictive, and is not deeply studiedin the litterature. In Section 3, the paper precisely describes the Rice-Mellin path, together with its tameness condition, in a survey style, too. Finally, in Section 4, the paper presents original results for the Rice-Mellin path: it exhibits a framework, of practical use, where the tameness condition is proven to hold. It then proves that the Rice-Mellin path is both of easy and practical use : even though (much?) less general than the Depoissonisation path, it is easier to apply.

Explore related subjects

Keep this discovery

BibTeXRIS

Brigitte Vallée. 2018-02-14. The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace. https://arxiv.org/abs/1802.04988

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