📑 Table of Contents

Equiprobability is a property for a collection of events that each have the same probability of occurring.[1] In statistics and probability theory it is applied in the discrete uniform distribution and the equidistribution theorem for rational numbers. If there are events under consideration, the probability of each occurring is

In philosophy it corresponds to a concept that allows one to assign equal probabilities to outcomes when they are judged to be equipossible or to be "equally likely" in some sense. The best-known formulation of the rule is Laplace's principle of indifference (or principle of insufficient reason), which states that, when "we have no other information than" that exactly mutually exclusive events can occur, we are justified in assigning each the probability This subjective assignment of probabilities is especially justified for situations such as rolling dice and lotteries since these experiments carry a symmetry structure, and one's state of knowledge must clearly be invariant under this symmetry.

A similar argument could lead to the seemingly absurd conclusion that the sun is as likely to rise as to not rise tomorrow morning. However, the conclusion that the sun is equally likely to rise as it is to not rise is only absurd when additional information is known, such as the laws of gravity and the sun's history. Similar applications of the concept are effectively instances of circular reasoning, with "equally likely" events being assigned equal probabilities, which means in turn that they are equally likely. Despite this, the notion remains useful in probabilistic and statistical modeling.

In Bayesian probability, one needs to establish prior probabilities for the various hypotheses before applying Bayes' theorem. One procedure is to assume that these prior probabilities have some symmetry which is typical of the experiment, and then assign a prior which is proportional to the Haar measure for the symmetry group: this generalization of equiprobability is known as the principle of transformation groups and leads to misuse of equiprobability as a model for incertitude.

See also

edit

References

edit
  1. ^ Balian, Roger; Balazs, N. L. (October 1, 1987). "Equiprobability, inference, and entropy in quantum theory". Annals of Physics. 179 (1): 97–144. doi:10.1016/S0003-4916(87)80006-4. ISSN 0003-4916.
edit

📚 Artikel Terkait di Wikipedia

Ergodic hypothesis

i.e., that over long periods of time all accessible microstates are equiprobable. Liouville's theorem states that, for a Hamiltonian system, the local

Entropy (information theory)

event can yield one of n equiprobable outcomes and another has one of m equiprobable outcomes then there are mn equiprobable outcomes of the joint event

Histogram

width. This avoids bins with low counts. A common case is to choose equiprobable bins, where the number of samples in each bin is expected to be approximately

Boy or girl paradox

{\displaystyle c_{1}} equiprobably from { B , G } {\displaystyle \mathrm {\{B,G\}} } Draw c 2 {\displaystyle c_{2}} equiprobably from { B , G } {\displaystyle

Cohen's kappa

and Wright noted, two important factors are prevalence (are the codes equiprobable or do their probabilities vary) and bias (are the marginal probabilities

Shannon (unit)

has an upper bound, which is reached when the possible outcomes are equiprobable. The maximum entropy of n bits is n Sh. A further quantity that it is

Advanced Encryption Standard

additional bit of key length, and if every possible value of the key is equiprobable; this translates into a doubling of the average brute-force key search

Information theory

that it is maximized when all the messages in the message space are equiprobable. For a source with n possible symbols, where p i = 1 n {\textstyle p_{i}={\frac