latest news

Distractions and amusements, with a sandwich and coffee.

Twenty — minutes — maybe — more.
•
• choose four words
• more quotes

The never-repeating digits of `\pi` can be approximated by `22/7 = 3.142857`

to within 0.04%. These pages artistically and mathematically explore rational approximations to `\pi`. This 22/7 ratio is celebrated each year on July 22nd. If you like hand waving or back-of-envelope mathematics, this day is for you: `\pi` approximation day!

Want more math + art? Discover the Accidental Similarity Number. Find humor in my poster of the first 2,000 4s of `\pi`.

What would circles look like if `\pi`=22/7?

Imagine that the circle had a tiny loop at one of its points. The circumference of this loop would be added to the circumference of the circle, but the loop would be so small that we would never notice it.

This is reminiscent of how string theories describe higher dimensions—as tiny loops at each point in space, except in my example the loop is only at one point.

This idea originated with Klein, who explained the fourth dimension as a curled up circle of a very small radius. Another way in which this curling-up is used is to say that the fifth dimension is a curled up Planck length, as explained in this Imagining 10 Dimensions video.

If this idea is difficult to wrap your head around, you're not alone. We cannot think of additional dimensions in the regular spatial sence since we have no means of experiencing such phenomena. We can however imagine how flatlanders might explain the 3rd dimension, since we can perceive it. They would draw the curled up circles in their plane because they would not have the experience of drawing with perspective mimicking our 3rd dimension.

We would draw their explanation as shown on the right in the figure above, borrowing from our concept of the 3rd spatial dimension. Now imagine showing our explanation to a flatlander. They would not see the same thing as you—the circles would not intuitively imply the higher dimension to them.

This is analogous to why we cannot draw folded up dimensions. We are merely *solidlanders*—flatlanders in 3d space. Creatures that can perceive more spatial dimensions would use us as examples of diminished perceptual ability.

Did you notice the fallacy in the term *solidlander*? We refer to solids as objects that occupy the maximum number of spatial dimensions. There's no reason to think that creatures that perceive more dimensions wouldn't use this word the same way we do. We're solidlanders from our perspective and they're solidlanders from theirs.

Another way to imagine how a circle might look is a little more realistic. The theory of special relativity tells us that when we travel at speed relative to another object the dimensions of that object appear contracted to us in the direction of motion.

This contraction is always present, but essentially imperceptible unless we're travelling fast enough. For example, in order for a 1 meter object to appear contracted by the length of a hydrogen molecule (0.3 nm) we would have to be travelling at 7.3 km/s (Wolfram Alpha calculation)!

How fast would we have to be going to compress the circle sufficiently so that its circumference and radius ratio embody the `22/7` approximation of `\pi`? Pretty fast, it turns out. If we travel at just over 12,000 km/sec (0.04 times the speed of light, Wolfram Alpha calculation), the circle will compress as shown in the figure above, and the ratio of its circumference to the radius along direction of motion will make `\pi` appear to be `22/7`.

This compression in length would be barely perceptible to us. Below are both circles, shown overlapping, with `delta` being the extra length in radius required.

The value of `\delta`, which is 0.0008049179155 (if `r = 1`), can be calculated by considering the perimeter of an ellipse. The fact that `\delta` is small shouldn't be surprising since `22/7` is an excellent approximation of `\pi`, good to 0.04%.

Calculating the parameter of an ellipse is more complicated than calculating it for a circle because it uses something called an elliptic integral. This integral has no analytical solution and requires numerical approximation. Luckily, we have computers.

We can use the expression shown above for the perimeter of the ellipse to determine how much the circle needs to be deformed. Let's write `a = r + \delta` (original radius with slight deformation `\delta`) and `b=r`. Since `22/7 > \pi` we know that `\delta > 0`.

It remains to solve the equation below for a value of `\delta` that will yield a ratio of circumference to `r` of `2 \times 22/7`.

To make things simpler, let set `r=1`. Solving the equation numerically, I find $$\delta = 0.0008049179155$$

You can verify this solution at Wolfram Alpha.

After all this, we come full-circle to the meaning of full-circle.

You might ask why I didn't change the definition of `\pi` to `22/7` in the upper limit of the integral. After all, why not make the approximation exercise more faithful to the approximation?

It turns out that if I did that I would get `\delta=0`, which brings us back to the original circle. How is this possible?

Technically, this is because the integral returns the upper limit as its answer if the eccentricity is zero (i.e., `E(x,0)=x`).

Intuitively, this is because changing the upper limit of the integral actually redefines the angle of a full revolution. Now, full-circle isn't `2 \pi` radians, but `2 \times 22/7`. Given that the ratio of the circumference of a circle to its radius is exactly the size, in radians, of a full revolution, we don't need to change the shape of the circle if we're willing to change what a full revolution means.

We examine two very common supervised machine learning methods: linear support vector machines (SVM) and k-nearest neighbors (kNN).

SVM is often less computationally demanding than kNN and is easier to interpret, but it can identify only a limited set of patterns. On the other hand, kNN can find very complex patterns, but its output is more challenging to interpret.

We illustrate SVM using a data set in which points fall into two categories, which are separated in SVM by a straight line "margin". SVM can be tuned using a parameter that influences the width and location of the margin, permitting points to fall within the margin or on the wrong side of the margin. We then show how kNN relaxes explicit boundary definitions, such as the straight line in SVM, and how kNN too can be tuned to create more robust classification.

Bzdok, D., Krzywinski, M. & Altman, N. (2018) Points of Significance: Machine learning: a primer. Nature Methods 15:5–6.

Bzdok, D., Krzywinski, M. & Altman, N. (2017) Points of Significance: Machine learning: a primer. Nature Methods 14:1119–1120.

In a Nature graphics blog article, I present my process behind designing the stark black-and-white Nature 10 cover.

Nature 10, 18 December 2017

In this primer, we focus on essential ML principles— a modeling strategy to let the data speak for themselves, to the extent possible.

The benefits of ML arise from its use of a large number of tuning parameters or weights, which control the algorithmâ€™s complexity and are estimated from the data using numerical optimization. Often ML algorithms are motivated by heuristics such as models of interacting neurons or natural evolutionâ€”even if the underlying mechanism of the biological system being studied is substantially different. The utility of ML algorithms is typically assessed empirically by how well extracted patterns generalize to new observations.

We present a data scenario in which we fit to a model with 5 predictors using polynomials and show what to expect from ML when noise and sample size vary. We also demonstrate the consequences of excluding an important predictor or including a spurious one.

Bzdok, D., Krzywinski, M. & Altman, N. (2017) Points of Significance: Machine learning: a primer. Nature Methods 14:1119–1120.

Just in time for the season, I've simulated a snow-pile of snowflakes based on the Gravner-Griffeath model.

The work is described as a wintertime tale in In Silico Flurries: Computing a world of snow and co-authored with Jake Lever in the Scientific American SA Blog.

Gravner, J. & Griffeath, D. (2007) Modeling Snow Crystal Growth II: A mesoscopic lattice map with plausible dynamics.

My illustration of the location of genes in the human genome that are implicated in disease appears in The Objects that Power the Global Economy, a book by Quartz.

We introduce two common ensemble methods: bagging and random forests. Both of these methods repeat a statistical analysis on a bootstrap sample to improve the accuracy of the predictor. Our column shows these methods as applied to Classification and Regression Trees.

For example, we can sample the space of values more finely when using bagging with regression trees because each sample has potentially different boundaries at which the tree splits.

Random forests generate a large number of trees by not only generating bootstrap samples but also randomly choosing which predictor variables are considered at each split in the tree.

Krzywinski, M. & Altman, N. (2017) Points of Significance: Ensemble methods: bagging and random forests. *Nature Methods* **14**:933–934.

Krzywinski, M. & Altman, N. (2017) Points of Significance: Classification and regression trees. *Nature Methods* **14**:757–758.