**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept# Probability space

Summary

In probability theory, a probability space or a probability triple is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models the throwing of a die.
A probability space consists of three elements:
A sample space, , which is the set of all possible outcomes.
An event space, which is a set of events, , an event being a set of outcomes in the sample space.
A probability function, , which assigns each event in the event space a probability, which is a number between 0 and 1.
In order to provide a sensible model of probability, these elements must satisfy a number of axioms, detailed in this article.
In the example of the throw of a standard die, we would take the sample space to be . For the event space, we could simply use the set of all subsets of the sample space, which would then contain simple events such as ("the die lands on 5"), as well as complex events such as ("the die lands on an even number"). Finally, for the probability function, we would map each event to the number of outcomes in that event divided by 6 – so for example, would be mapped to , and would be mapped to .
When an experiment is conducted, we imagine that "nature" "selects" a single outcome, , from the sample space . All the events in the event space that contain the selected outcome are said to "have occurred". This "selection" happens in such a way that if the experiment were repeated many times, the number of occurrences of each event, as a fraction of the total number of experiments, would most likely tend towards the probability assigned to that event by the probability function .
The Soviet mathematician Andrey Kolmogorov introduced the notion of probability space, together with other axioms of probability, in the 1930s. In modern probability theory there are a number of alternative approaches for axiomatization – for example, algebra of random variables.
A probability space is a mathematical triplet that presents a model for a particular class of real-world situations.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Related people (1)

Related units (1)

Related concepts (39)

Related MOOCs (4)

Related courses (168)

In probability theory, an event is a set of outcomes of an experiment (a subset of the sample space) to which a probability is assigned. A single outcome may be an element of many different events, and different events in an experiment are usually not equally likely, since they may include very different groups of outcomes. An event consisting of only a single outcome is called an or an ; that is, it is a singleton set. An event is said to if contains the outcome of the experiment (or trial) (that is, if ).

In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel. For a topological space X, the collection of all Borel sets on X forms a σ-algebra, known as the Borel algebra or Borel σ-algebra. The Borel algebra on X is the smallest σ-algebra containing all open sets (or, equivalently, all closed sets).

In probability theory, an elementary event, also called an atomic event or sample point, is an event which contains only a single outcome in the sample space. Using set theory terminology, an elementary event is a singleton. Elementary events and their corresponding outcomes are often written interchangeably for simplicity, as such an event corresponding to precisely one outcome. The following are examples of elementary events: All sets where if objects are being counted and the sample space is (the natural numbers).

The activity of neurons in the brain and the code used by these neurons is described by mathematical neuron models at different levels of detail.

The activity of neurons in the brain and the code used by these neurons is described by mathematical neuron models at different levels of detail.

Discrete choice models are used extensively in many disciplines where it is important to predict human behavior at a disaggregate level. This course is a follow up of the online course “Introduction t

MGT-499: Statistics and data science

This class provides a hands-on introduction to statistics and data science, with a focus on causal inference, applications to sustainability issues using Python, and dissemination of scientific result

MATH-234(b): Probability and statistics

Ce cours enseigne les notions élémentaires de la théorie de probabilité et de la statistique, tels que l'inférence, les tests et la régression.

MATH-519: Untitled

This year we will be looking into probabilistic study of some models of mathematical physics.

Related lectures (995)

Daniel Maria Busiello, Deepak Gupta

We consider a general discrete state-space system with both unidirectional and bidirectional links. In contrast to bidirectional links, there is no reverse transition along the unidirectional links Herein, we first compute the statistical length and the thermodynamic cost function for transitions in the probability space, highlighting contributions from total, environmental, and resetting (unidirectional) entropy production. Then we derive the thermodynamic bound on the speed limit to connect two distributions separated by a finite time, showing the effect of the presence of unidirectional transitions. Uncertainty relationships can be found for the temporal first and second moments of the average resetting entropy production. We derive simple expressions in the limit of slow unidirectional transition rates. Finally, we present a refinement of the thermodynamic bound by means of an optimization procedure. We numerically investigate these results on systems that stochastically reset with constant and periodic resetting rate.

2020Victor Panaretos, Anirvan Chakraborty

We consider the problem of estimating the slope function in a functional regression with a scalar response and a functional covariate. This central problem of functional data analysis is well known to be ill-posed, thus requiring a regularised estimation procedure. The two most commonly used approaches are based on spectral truncation or Tikhonov regularisation of the empirical covariance operator. In principle, Tikhonov regularisation is the more canonical choice. Compared to spectral truncation, it is robust to eigenvalue ties, while it attains the optimal minimax rate of convergence in the mean squared sense, and not just in a concentration probability sense. In this paper, we show that, surprisingly, one can strictly improve upon the performance of the Tikhonov estimator in finite samples by means of a linear estimator, while retaining its stability and asymptotic properties by combining it with a form of spectral truncation. Specifically, we construct an estimator that additively decomposes the functional covariate by projecting it onto two orthogonal subspaces defined via functional PCA; it then applies Tikhonov regularisation to the one component, while leaving the other component unregularised. We prove that when the covariate is Gaussian, this hybrid estimator uniformly improves upon the MSE of the Tikhonov estimator in a non-asymptotic sense, effectively rendering it inadmissible. This domination is shown to also persist under discrete observation of the covariate function. The hybrid estimator is linear, straightforward to construct in practice, and with no computational overhead relative to the standard regularisation methods. By means of simulation, it is shown to furnish sizeable gains even for modest sample sizes.

2019This work is dedicated to the study of Borel equivalence relations acting on Borel fields of CAT(0) metric spaces over a standard probability space. In this new framework we get similar results to some theorems proved recently by S. Adams-W. Ballmann or N. Monod concerning groups of isometries of CAT(0) spaces. In Chapter 1, we build several Borel structures on a variety of fields before dealing in particular with Borel fields of CAT(0) spaces. Chapter 2 discusses the notion of an action for an equivalence relation on a field of metric spaces and gives several examples. We also introduce a definition of amenability for equivalence relations in terms of invariant section following an idea of R.J. Zimmer. Chapter 3 deals with the action of an amenable equivalence relation and shows that such a relation cannot act without fixing a section at infinity or preserving a subfield of Euclidean spaces. In Chapter 4, we show that if an equivalence relation is generated by two commuting groups and acts without fixing a section at infinity, then the field splits equivariantly and isometrically as a product. Using this result we also show that equivalence relations containing two coamenable subrelations cannot act without fixing a section at infinity or preserving a subfield of Euclidean spaces.

Probability and Statistics for SICMATH-232: Probability and statistics

Delves into probability, statistics, random experiments, and statistical inference, with practical examples and insights.

Conditional Probability: Prediction DecompositionMATH-232: Probability and statistics

Explores conditional probability, Bayes' theorem, and prediction decomposition for informed decision-making.

Probability and Statistics: Independence and Conditional ProbabilityMATH-232: Probability and statistics

Explores independence and conditional probability in probability and statistics, with examples illustrating the concepts and practical applications.