SearcharxivSearch

arXiv · math/0512427

Generalized probabilities taking values in non-Archimedean fields and topological groups

Abstract

We develop an analogue of probability theory for probabilities taking values in topological groups. We generalize Kolmogorov's method of axiomatization of probability theory: main distinguishing features of frequency probabilities are taken as axioms in the measure-theoretic approach. We also present a review of non-Kolmogorovian probabilistic models including models with negative, complex, and $p$-adic valued probabilities. The latter model is discussed in details. The introduction of $p$-adic (as well as more general non-Archimedean) probabilities is one of the main motivations for consideration of generalized probabilities taking values in topological groups which are distinct from the field of real numbers. We discuss applications of non-Kolmogorovian models in physics and cognitive sciences. An important part of this paper is devoted to statistical interpretation of probabilities taking values in topological groups (and in particular in non-Archimedean fields).

Explore related subjects

Keep this discovery

BibTeXRIS

Andrei Khrennikov. 2005-12-18. Generalized probabilities taking values in non-Archimedean fields and topological groups. https://doi.org/10.1134/s1061920807020033

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