SearcharxivSearch

arXiv · 2605.02104

Chart-Generated Probability Geometry and Kolmogorov Expectations

Abstract

This paper develops a geometric reinterpretation of probability in which a cumulative distribution function is not used merely as a passive coordinate label, but as a generator of metric geometry. An admissible probability chart $G:I\to(0,1)$ pulls the Euclidean distance of the probability interval back to value space. This creates a decisive distinction from ordinary coordinate invariance: if $G$ is replaced by another chart $H$ while the observations and their law are kept fixed, the induced metric-measure structure changes. Probability charts preserve ordinal structure while altering metric notions such as distance, dispersion, boundary proximity, and barycentric centrality. Averaging linearly in the chart coordinate and pulling the result back defines the Fr\'echet barycenter of $X$ under $d_G$. These functionals coincide with Kolmogorov-Nagumo means, but the chart-generated viewpoint explains their chart dependence geometrically: changing the chart changes the loss being minimized, rather than merely rewriting one fixed centre in new coordinates. A rigidity result shows that, within normalized probability charts, preserving the barycenter for every law forces the chart itself to remain unchanged. Under the intrinsic chart the coordinates are uniform and the barycenter is the median; under an external benchmark chart, tail mismatch is represented by excess boundary occupation. Laws of large numbers, central limit theorems, and a non-asymptotic concentration inequality are established for the transformed functionals. Probability-coordinate moments exist for every law supported on the chart domain and determine the law uniquely, in contrast with classical moment non-existence and indeterminacy on unbounded value spaces.

Explore related subjects

Keep this discovery

BibTeXRIS

Manuela-Simona Cojocea. 2026-05-04. Chart-Generated Probability Geometry and Kolmogorov Expectations. https://arxiv.org/abs/2605.02104

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