Concept

Law of large numbers

In probability theory, the law of large numbers (LLN) is a theorem that describes the result of performing the same experiment a large number of times. According to the law, the average of the results obtained from a large number of trials should be close to the expected value and tends to become closer to the expected value as more trials are performed. The LLN is important because it guarantees stable long-term results for the averages of some random events. For example, while a casino may lose money in a single spin of the roulette wheel, its earnings will tend towards a predictable percentage over a large number of spins. Any winning streak by a player will eventually be overcome by the parameters of the game. Importantly, the law applies (as the name indicates) only when a large number of observations are considered. There is no principle that a small number of observations will coincide with the expected value or that a streak of one value will immediately be "balanced" by the others (see the gambler's fallacy). The LLN only applies to the average. Therefore, while other formulas that look similar are not verified, such as the raw deviation from "theoretical results": not only does it not converge toward zero as n increases, but it tends to increase in absolute value as n increases. For example, a single roll of a fair, six-sided die produces one of the numbers 1, 2, 3, 4, 5, or 6, each with equal probability. Therefore, the expected value of the average of the rolls is: According to the law of large numbers, if a large number of six-sided dice are rolled, the average of their values (sometimes called the sample mean) will approach 3.5, with the precision increasing as more dice are rolled. It follows from the law of large numbers that the empirical probability of success in a series of Bernoulli trials will converge to the theoretical probability. For a Bernoulli random variable, the expected value is the theoretical probability of success, and the average of n such variables (assuming they are independent and identically distributed (i.

Official source

https://en.wikipedia.org/wiki/Law_of_large_numbers

About this result

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 courses (32)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

CS-401: Applied data analysis

This course teaches the basic techniques, methodologies, and practical skills required to draw meaningful insights from a variety of data, with the help of the most acclaimed software tools in the data science world (pandas, scikit-learn, Spark, etc.) ...

PHYS-512: Statistical physics of computation

The students understand tools from the statistical physics of disordered systems, and apply them to study computational and statistical problems in graph theory, discrete optimisation, inference and machine learning. ...

Related units (13)

Chair of Statistics

IGM - Administration

Chair of Mathematical Statistics

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Law_of_large_numbers

About this result

Ontological neighbourhood

Statistics

Statistical inference: Mathematical statistics

Related courses (32)

CS-101: Advanced information, computation, communication I

CS-401: Applied data analysis

PHYS-512: Statistical physics of computation

Related lectures (32)

Law of Large Numbers: Statistics

Explains the Law of Large Numbers and its application to random variables.

Statistics for Data Science: Introduction to Statistical Methods

Covers the fundamental concepts of statistics and their application in data science.

Random Variables and Expected Value

Introduces random variables, probability distributions, and expected values through practical examples.

Related publications (32)

Return period analysis of weakly non-stationary processes with trends

Traditional return period analysis represents an essential tool for practitioners to assess the magnitude and occurrence of extreme events. The analysis considers stationary time series and assumes independent and identically distributed events. However, many environmental processes exhibit time-varying changes due to signal trends or shifts, leading to non-stationary behaviors. Although several approaches have been proposed in the literature and a formulation exists for the return period under non-stationa

Copernicus Publications2026

Recovering Communities in Structured Random Graphs

The problem of recovering planted community structure in random graphs has received a lot of attention in the literature on the stochastic block model, where the input is a random graph in which edges crossing between different communities appear with smaller probability than edges induced by communities. The communities themselves form a collection of vertex-disjoint sparse cuts in the expected graph, and can be recovered, often exactly, from a sample as long as a separation condition on the intra- and int

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

Bigger Isn’t Always Better: Towards a General Prior for Medical Image Reconstruction

Diffusion models play an important role in many state-of-the-art algorithms to solve inverse problems in imaging. In particular, reconstructing MRI and CT images from undersampled data can be reformulated as a canonical inverse problem that benefits from strong priors. Researchers typically re-purpose models originally designed for unconditional sampling without modifications and achieve remarkable accuracy on in-distribution (ID) reconstruction. However, due to the scarce availability of training data and

2026

Related people (32)

Yanina Yurina Shkel

Teaching & PhD PhD Students Serhat Emre Coban, Anuj Kumar Yadav, Cemre Çadir Courses Advanced probability and applications COM-417 In this course, various aspects of probability theory are considered. The first part covers the main theorems in the field (law of large numbers, central limit theorem), while the second part focuses on the theory of martingales and concentration inequalities. Signal processing COM-202 Signal processing theory and applications: discrete and cont

Thomas Mountford

Teaching & PhD Past EPFL PhD Students Damien Gauthier, Samir Brahim Belhaouari, Driss Baraka, Daniel Rodrigues Valesin, Samuel Schöpfer, Kamran Kalbasi, Jacques Saliba, Hao Xue, Keming Chen Past EPFL PhD Students as codirector Guillaume Charles Woessner Courses Analysis I MATH-101(d) Study the fundamental concepts of analysis, and the differential and integral calculus of real-valued functions of one real variable. Markov chains MATH-332 The course follows the text of Norris

Dario Floreano

Prof. Dario Floreano is director of the Laboratory of Intelligent Systems at the Swiss Federal Institute of Technology Lausanne (EPFL). Since 2010, he is the founding director of the Swiss National Center of Competence in Robotics, a research program that brings together more than 20 labs across Switzerland. Prof. Floreano holds an M.A. in Vision, an M.S. in Neural Computation, and a PhD in Robotics. He has held research positions at Sony Computer Science Laboratory, at Caltech/JPL, and at Harvard University. His main research interests are Robotics and A.I. at the convergence of biology and engineering. Prof. Floreano made pioneering contributions to the fields of evolutionary robotics, aerial robotics, and soft robotics. He served in numerous advisory boards and committees, including the Future and Emerging Technologies division of the European Commission, the World Economic Forum Agenda Council, the International Society of Artificial Life, the International Neural Network Society, and in the editorial committee of several scientific journals. In addition, he helped spinning off two drone companies (senseFly.com and Flyability.com) and a non-for-profit portal on robotics and A.I. (RoboHub.org). Books Manuale sulle Reti Neurali, il Mulino (in Italian), 1996 (first edition), 2006 (second edition)Evolutionary Robotics, MIT Press, 2000 Bio-Inspired Artificial Intelligence, MIT Press, 2008 Flying Insects and Robots, Springer Verlag, 2010

Volkan Cevher

Volkan Cevher received the B.Sc. (valedictorian) in electrical engineering from Bilkent University in Ankara, Turkey, in 1999 and the Ph.D. in electrical and computer engineering from the Georgia Institute of Technology in Atlanta, GA in 2005. He was a Research Scientist with the University of Maryland, College Park from 2006-2007 and also with Rice University in Houston, TX, from 2008-2009. Currently, he is an Associate Professor at the Swiss Federal Institute of Technology Lausanne and a Faculty Fellow in the Electrical and Computer Engineering Department at Rice University. His research interests include machine learning, signal processing theory, optimization theory and methods, and information theory. Dr. Cevher is an ELLIS fellow and was the recipient of the Google Faculty Research award in 2018, the IEEE Signal Processing Society Best Paper Award in 2016, a Best Paper Award at CAMSAP in 2015, a Best Paper Award at SPARS in 2009, and an ERC CG in 2016 as well as an ERC StG in 2011.

Damir Filipovic

Damir Filipovic holds the Swissquote Chair in Quantitative Finance and is Swiss Finance Institute Professor at the Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland. Prior to this, he was head of the Vienna Institute of Finance and professor at the University of Vienna. He previously held the chair of financial and insurance mathematics at the University of Munich, and he was on the faculty of Princeton University. He received his Ph.D. in mathematics from ETH Zurich in 2000. Damir Filipovic worked as a scientific consultant for the Swiss Federal Office of Private Insurance from 2003 to 2004. There he co-developed the Swiss Solvency Test, which defines the regulatory capital requirement for all Swiss based insurance companies and groups. He is on the editorial board of several academic journals. His research interests include the term structure of interest rates, credit and volatility risk, quantitative methods in risk management, and stochastic processes. His papers have been published in a variety of academic journals including the Journal of Financial Economics, Mathematical Finance, Finance and Stochastics, and the Annals of Applied Probability. He is the author of a textbook titled Term-Structure Models.

Ian Smith

PhD, Cambridge University, 1982 Interests 1 Active shape control for structures for deployment and where serviceability criteria governs 2 Biomimetic structures (learning, self-diagnosis, self-repair) 3 Infrastructure management support through structural identification 4 Advanced computer-aided engineering applications of stochastic optimization and search, multi-criteria analysis, system uncertainties (measurement and modelling), multi-modal approaches (combining statistics with behavior models) More details : see https://www.epfl.ch/labs/imac/research/iansmith/

Olivier Schneider

After his thesis defense in particle physics in 1989 at University of Lausanne, Olivier Schneider joins LBL, the Lawrence Berkeley Laboratory (California), to work on the CDF experiment at the Tevatron in Fermilab (Illinois), first as a research fellow supported by the Swiss National Science Foundation, and later as a post-doc at LBL. He participates in the construction and commissioning of the first silicon vertex detector to operate successfully at a hadron collider; this detector enabled the discovery of the sixth quark, named "top". Since 1994, he comes back to Europe and participates in the ALEPH experiment at CERN's Large Electron-Positron Collider, as CERN fellow and then as CERN scientific staff. He specializes in heavy flavour physics. In 1998, he becomes associate professor at University of Lausanne, then extraordinary professor at the Swiss Institute of Technology Lausanne (EPFL) in 2003, and finally full professor at EPFL in 2010. Having worked since 1997 on the preparation of the LHCb experiment at CERN's Large Hadron Collider, which started operation in 2009, he is now analyzing the first data. He also contributes since 2001 to the exploitation of the data recorded at the Belle experiment (KEK laboratory, Tsukuba, Japan). These two experiments study mainly the decays of hadrons containing a b quark, as well CP violation, i.e. the non-invariance under the symmetry between matter and antimatter.

Florian Karl Richter

Curriculum vitae You can download my CV here ResearchResearch Fields Ergodic Theory, Combinatorics, Number TheoryList of Publications Open-access preprints and e-prints of all my publications are freely available on arXiv ↗ .An inverse theorem for sumsets of sets of positive density in the integersEthan Ackelsberg, Florian K. Richter submitted, 117 pageslink ↗Weighted averages of arithmetic functions and applications to equidistributionVitaly Bergelson, Michael Reilly, Florian K. Richter submitted, 29 page

Valentin Simeonov

ResearchComplete publication list Valentin SimeonovCollaborateur scientifique- EPFL ENAC EFLUMList of publicationsRefereed 1. V. Mitev, V. Simeonov, and I. Grigorov, "Model experiment in measuring the temperature and concentration of water vapours in air by spontaneous Raman scattering", Bulg. J. Phys. 9, No 5, pp. 549-558, (1982)2. V. Mitev, V. Simeonov, and I. Grigorov, ”Atmospheric gases temperature measurements by pure rotational Raman scattering”, Russian Journal of Applied Spectroscopy, 39,

Yoav Zemel

Related units (13)

Chair of Statistics

IGM - Administration

Chair of Mathematical Statistics

Related concepts (32)

Law of averages

The law of averages is the commonly held belief that a particular outcome or event will, over certain periods of time, occur at a frequency that is similar to its probability. Depending on context or application it can be considered a valid common-sense observation or a misunderstanding of probability. This notion can lead to the gambler's fallacy when one becomes convinced that a particular outcome must come soon simply because it has not occurred recently (e.g.

Characteristic function (probability theory)

In probability theory and statistics, the characteristic function of any real-valued random variable completely defines its probability distribution. If a random variable admits a probability density function, then the characteristic function is the Fourier transform of the probability density function. Thus it provides an alternative route to analytical results compared with working directly with probability density functions or cumulative distribution functions.

Infinite monkey theorem

The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type any given text, including the complete works of William Shakespeare. In fact, the monkey would almost surely type every possible finite text an infinite number of times. The theorem can be generalized to state that any sequence of events which has a non-zero probability of happening will almost certainly eventually occur, given unlimited time.

Related exercises (3)

The hare and the turtle

A hare and a turtle race over a distance L. The turtle starts running at constant speed

v_{\rm t}

and the hare at constant speed

v_{\rm h}

. The hare is not taking this seriously, and so

v_{\rm h} < v_{\rm t}

. When the turtle reaches a bridge that stands at a distance L′u2004

Orders of magnitude

Make some rough estimations (in terms of powers of 10) according to your “feeling” (test for a job interview as “management consultant”...):

How many pencils would you need to draw a straight line along the Earth’s equator ?
How many wedding dresses are sold every year in Italy ?
How many individual hairs are on your head ?
How many water drops are contained in all the oceans of the globe ?
How many CHF 10 banknotes have to be piled up to reach the moon ? Would a space missi

Gravitational field inside the Earth

We consider the earth as a compact set of concentric spheres.

Use a geometric argument to show that the field vanishes inside a spherical shell. Thus, for a given point, only the spherical shell for which the point is in the exterior contributes to the field at that point.
Compute the gravitational field inside the earth and outside as a function of the distance to the centre.
A volume element of a sphere is expressed in spherical coordinates as (c.f. figure): dVu2004=

Related notebooks (12)

Wavepacket construction and propagation in 1D tight-binding model

"# Wavepacket construction and propagation along the 1D chain \n", "\n", "## Introduction\n", "In this notebook, we demonstrate the wavepacket construction and propagation, which is at the heart of the semiclassical approximation. For simplicty, we will consider the familiar 1D chain described using the tight-binding Hamiltonian. We will have to take a sufficiently large number of sites

N

and impose periodic boundary conditions. For simplicity, in the code below we assume lattice constant $a =

Ewald Sphere

::: {role="main"} ::: {.jp-Cell .jp-MarkdownCell .jp-Notebook-cell} ::: {.jp-Cell-inputWrapper tabindex="0"} ::: {.jp-Collapser .jp-InputCollapser .jp-Cell-inputCollapser} ::: ::: {.jp-InputArea .jp-Cell-inputArea} ::: {.jp-InputPrompt .jp-InputArea-prompt} ::: ::: {.jp-RenderedHTMLCommon .jp-RenderedMarkdown .jp-MarkdownOutput mime-type="text/markdown"}

Ewald Sphere¶{.anchor-link} {#Ewald-Sphere}

Play with the Ewald Sphere This schematics represent the Ewald sphere for a typical high

Designing FIR Filters Using the Parks-McClellan Algorithm

The Parks-McClellan Filter Design Method[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

The Parks-McClellan (PM) algorithm is a clever application of advanced polynomial fitting techniques to the problem of FIR filter design. In this notebook we will explore the key ideas behind the method by considering the design of a simple Type-I lowpass filter. NOTE: This notebook uses interactive widgets. If the interactive controls do not work or show up, please fo

Implementing a Fractional Resampler using Local Lagrange Interpolation

FIR Resampling[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will implement a simple fractional resampler that uses local Lagrange interpolation. The resampler can be used to perform any rational sampling rate change (but beware of aliasing when downsampling!) In [1]: import numpy as np import IPython from scipy.io import wavfile Local Lagrange interpolation[4]¶ To perform resampling we will need to compute subsample values and, in

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will explore various ways to implement a system that changes the voice of a speaker. Typical applications for these techniques, strictly sorted by plausibility, include international spy missions and prank telephone calls, and devices such as the one displayed here can be easily bought on the web... or in a novelty shop. No description has been provided for t