number_blocking_graph

Blocking probabilities calculated by the exact and approximate solutions for various levels of neighbour- spoofed spam calls. The blue curves depict the toy enumeration example above (solid line is exact, dashed line is approximate), for which 𝑛 = 𝟣𝟣 and 𝑘 = 𝟦𝟪. All other curves apply to the number blocking problem, for which 𝑛 = 𝟩𝟩. For these, the exact and approximate results are visually indistinguishable.

Madeleine Hall

Madeleine is a former pHd StUdEnT in mathematics and behavioural genomics at Imperial College London. She likes open water swimming, toast, the Oxford comma, and tHiS mEmE. She has still found none of her optimised strokes of any use in the Serpentine.

The big argument: Is Matlab better than Python?
Which do you prefer?
Significant figures: Gladys West
Madeleine Hall looks at one of the minds behind GPS
My favourite LaTeX package
The Chalkdust editors share some of their favourites
On the cover: Vhat? Vhere? Venn
Madeleine Hall takes a brief dive into the world’s favourite set-relationship-representation diagram.
On conditional probability: Cards, Covid, and Crazy Rich Asians
Madeleine Hall explores the sometimes counterintuitive consequences of conditional probability to our everyday lives.
Counting caterpillars
Peter Rowlett uses combinatorics to generate caterpillars