liveBook · Manning

Mean

As explained in Timeless Algorithms, The Foundational Ideas

Expected value is the probability-weighted average of the possible numerical outcomes of a random variable.

Expected value summarizes uncertain numerical outcomes by weighting each outcome by its probability: E[X] = ∑ᵢ xᵢpᵢ. It connects probability to decisions by helping compare alternatives under uncertainty. section 2.3.3

E[X]=∑i=1nxipi

Each xᵢ is a possible outcome and pᵢ its probability; summing their products gives the expected value. section 2.3.3

Two possible outcomes

If outcomes are 10 and −5, each with probability 0.5, the expected value is (0.5)(10) + (0.5)(−5) = 2.5. section 2.3.3

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines the weighted-sum formula and demonstrates it with a two-outcome calculation.
Examples
Calculates an expected value from outcomes of 10 and −5, each assigned probability 0.5.
What you can do after
Evaluate alternatives by combining possible outcomes with their probabilities.
How it connects
Connects probability and Bayesian inference to decision-making, alongside odds as a measure of competing beliefs.

Also explained in

Compare how 35 books explain mean →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.