SearcharxivSearch

arXiv · 1801.08698

Average values of functionals and concentration without measure

Abstract

Although there doesn't exist the Lebesgue measure in the ball $M$ of $C[0,1]$ with $p-$norm, the average values (expectation) $EY$ and variance $DY$ of some functionals $Y$ on $M$ can still be defined through the procedure of limitation from finite dimension to infinite dimension. In particular, the probability densities of coordinates of points in the ball $M$ exist and are derived out even though the density of points in $M$ doesn't exist. These densities include high order normal distribution, high order exponent distribution. This also can be considered as the geometrical origins of these probability distributions. Further, the exact values (which is represented in terms of finite dimensional integral) of a kind of infinite-dimensional functional integrals are obtained, and specially the variance $DY$ is proven to be zero, and then the nonlinear exchange formulas of average values of functionals are also given. Instead of measure, the variance is used to measure the deviation of functional from its average value. $DY=0$ means that a functional takes its average on a ball with probability 1 by using the language of probability theory, and this is just the concentration without measure. In addition, we prove that the average value depends on the discretization.

Explore related subjects

Keep this discovery

BibTeXRIS

Cheng-shi Liu. 2018-01-26. Average values of functionals and concentration without measure. https://arxiv.org/abs/1801.08698

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