Fourier-Motzkin Elimination: An Old Trick I Still Use

Fourier-Motzkin elimination is one of those methods that gets a page and a half in the linear programming textbooks, right before the simplex method shows up and steals the whole show. I was first introduced to it while working as an OR analyst at Cargill, and my honest first reaction was: nice, but why would I ever use this? It took me years (and one very stubborn model) to change my mind. This post is the explanation I wish someone had given me back then: what the method actually does, how the mechanics work, and a small worked example showing a model before and after the elimination.

Continue reading “Fourier-Motzkin Elimination: An Old Trick I Still Use”

McNemar’s test and Simpson’s Paradox (and the “hot hand” in basketball)

hot hand basketball

(I wrote this paper in 2007 for a Statistics class I took while trying to do a Ph.D. I am sharing it here for posterity.)

McNemar’s test is a non-parametric method used on nominal data to determine whether the row and column marginal frequencies are equal. It is applied to 2×2 contingency tables with a dichotomous trait with matched pairs of subjects.

Simpson’s paradox is a statistical paradox in which the successes of several groups seem to be reversed when the groups are combined. This seemingly impossible result is encountered often in social science statistics and occurs when a weighting variable, which is not relevant to the individual group assessment, must be used in the combined assessment.

The paper evaluates the potential effect of Simpson’s paradox in McNemar’s test results and conclusions.


Continue reading “McNemar’s test and Simpson’s Paradox (and the “hot hand” in basketball)”