Search arXivSearch

arXiv · 1901.10507

Limiting Probability Measures

Abstract

The coordinates along any fixed direction(s), of points on the sphere $S^{n-1}(\sqrt{n})$, roughly follow a standard Gaussian distribution as $n$ approaches infinity. We revisit this classical result from a nonstandard analysis perspective, providing a new proof by working with hyperfinite dimensional spheres. We also set up a nonstandard theory for the asymptotic behavior of integrals over varying domains in general. We obtain a new proof of the Riemann--Lebesgue lemma as a by-product of this theory. We finally show that for any function $f \co \mathbb{R}^k \to \mathbb{R}$ with finite Gaussian moment of an order larger than one, its expectation is given by a Loeb integral integral over a hyperfinite dimensional sphere. Some useful inequalities between high-dimensional spherical means of $f$ and its Gaussian mean are obtained in order to complete the above proof. A review of the requisite nonstandard analysis is provided.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Irfan Alam. 2019-01-29. Limiting Probability Measures. https://doi.org/10.4115/jla.2020.12.1

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