SearcharxivSearch

arXiv · 2410.05228

Cournot's principle for measure-theoretic probability

Abstract

The problem of relating the mathematics of probability theory to the empirical world of experiments has been debated for centuries. One of the oldest solutions proposed for this problem is a principle that states that an event with probability close to 1 nearly certainly occurs in a single trial of an experiment. This principle is now called $\textit{Cournot' principle}$. Cournot's principle was first formulated in the context of classical probability, in which the probability of any event is given, and the $\textit{product rule}$, i.e., the rule that the probability that two events occur in two separated trials is the product of their probabilities, can be deduced. On the contrary, in the modern measure-theoretic approach to probability, probability measures and experiments are separate entities that must be related in an appropriate way, and the product rule cannot be deduced. In this paper, a version of Cournot's principle suitable for measure-theoretic probability is proposed. Therefore, the principle is reformulated as a criterion for relating probability measures and experiments, and the product rule is explicitly stated. In spite of the vagueness of the notions involved, the new version is formulated in a rigorous manner and an exact result, namely, that at most one probability measure can be related to an experiment, is rigorously proven.

Explore related subjects

Keep this discovery

BibTeXRIS

Bruno Galvan. 2024-10-07. Cournot's principle for measure-theoretic probability. https://arxiv.org/abs/2410.05228

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