ArticleslgStudy

mathematics

Holm–Bonferroni method

Holm–Bonferroni method is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Holm–Bonferroni method rather than just read about it. In short: In statistics, the Holm–Bonferroni method, also called the Holm method or Bonferroni–Holm method, is used to counteract the problem of multiple comparisons. It is intended to control the family-wise error rate (FWER) and offers a simple test uniformly more powerful than the Bonferroni correction.

Key takeaways

  • Holm–Bonferroni method belongs to mathematics; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Holm–Bonferroni method to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Holm–Bonferroni method from memory before moving on to harder problems.

Reference excerpt

In statistics, the Holm–Bonferroni method, also called the Holm method or Bonferroni–Holm method, is used to counteract the problem of multiple comparisons. It is intended to control the family-wise error rate (FWER) and offers a simple test uniformly more powerful than the Bonferroni correction. It is named after Sture Holm, who codified the method, and Carlo Emilio Bonferroni.

Motivation When considering several hypotheses, the problem of multiplicity arises: the more hypotheses are tested, the higher the probability of obtaining Type I errors (false positives). The Holm–Bonferroni method is one of many approaches for controlling the FWER, i.e., the probability that one or more Type I errors will occur, by adjusting the rejection criterion for each of the individual hypotheses.

Formulation The method is as follows:

Suppose you have m {\displaystyle m} p-values, sorted into order lowest-to-highest P 1 , … , P m {\displaystyle P_{1},\ldots ,P_{m}} , for the corresponding null hypotheses H 1 , … , H m {\displaystyle H_{1},\ldots ,H_{m}} . And suppose the desired maximum FWER is α {\displaystyle \alpha } . Is P 1 ≤ α / m {\displaystyle P_{1}\leq \alpha /m} ? If so, reject H 1 {\displaystyle H_{1}} and continue to the next step, otherwise EXIT. Is P 2 ≤ α / ( m − 1 ) {\displaystyle P_{2}\leq \alpha /(m-1)} ? If so, reject H 2 {\displaystyle H_{2}} also, and continue to the next step, otherwise EXIT. And so on: for each P value, test whether P k ≤ α m + 1 − k {\displaystyle P_{k}\leq {\frac {\alpha }{m+1-k}}} . If so, reject H k {\displaystyle H_{k}} and continue to examine the larger P values, otherwise EXIT. This method ensures that the FWER is at most α {\displaystyle \alpha } , in the strong sense.

Rationale The simple Bonferroni correction rejects only null hypotheses with p-value less than or equal to α m {\displaystyle {\frac {\alpha }{m}}} , in order to ensure that the FWER, i.e., the risk of rejecting one or more true null hypotheses (i.e., of committing one or more type I errors) is at most α {\displaystyle \alpha } . The cost of this protection against type I errors is an increased risk of failing to reject one or more false null hypotheses (i.e., of committing one or more type II errors). The Holm–Bonferroni method also controls the FWER at α {\displaystyle \alpha } , but with a lower increase of type II error risk than the classical Bonferroni method. The Holm–Bonferroni method sorts the p-values from lowest to highest and compares them to nominal alpha levels of α m {\displaystyle {\frac {\alpha }{m}}} to α {\displaystyle \alpha } (respectively), namely the values α m , α m − 1 , … , α 2 , α 1 {\displaystyle {\frac {\alpha }{m}},{\frac {\alpha }{m-1}},\ldots ,{\frac {\alpha }{2}},{\frac {\alpha }{1}}} .

The index k {\displaystyle k} identifies the first p-value that is not low enough to validate rejection. Therefore, the null hypotheses H ( 1 ) , … , H ( k − 1 ) {\displaystyle H_{(1)},\ldots ,H_{(k-1)}} are rejected, while the null hypotheses H ( k ) , . . . , H ( m ) {\displaystyle H_{(k)},...,H_{(m)}} are not rejected. If k = 1 {\displaystyle k=1} then no p-values were low enough for rejection, therefore no null hypotheses are rejected. If no such index k {\displaystyle k} could be found then all p-values were low enough for rejection, therefore all null hypotheses are rejected (none are accepted).

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Holm–Bonferroni method

Start with the simplest possible case. Write down what Holm–Bonferroni method claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Holm–Bonferroni method before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Holm–Bonferroni method ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Holm–Bonferroni method

In research
Holm–Bonferroni method appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Holm–Bonferroni method in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Holm–Bonferroni method is common in secondary-school and first-year university syllabi. It links to neighbouring topics Multiple comparisons, Statistical tests, so understanding it makes those chapters shorter.
In everyday life
Look for Holm–Bonferroni method outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Holm–Bonferroni method” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Holm–Bonferroni method in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Holm–Bonferroni method means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Holm–Bonferroni method out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Holm–Bonferroni method in simple terms?

In statistics, the Holm–Bonferroni method, also called the Holm method or Bonferroni–Holm method, is used to counteract the problem of multiple comparisons. It is intended to control the family-wise error rate (FWER) and offers a simple test uniformly more powerful than the Bonferroni correction.

Why does Holm–Bonferroni method matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Holm–Bonferroni method?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Holm–Bonferroni method.

Tags

  • Multiple comparisons
  • Statistical tests

Keep exploring