Directed acyclic graphs: a tool for causal studies in paediatrics

Abstract

Many paediatric clinical research studies, whether observational or interventional, have as an eventual aim the identification or quantification of causal relationships. One might ask: does screen time influence childhood obesity? Could overuse of paracetamol in infancy cause wheeze? How does breastfeeding affect later cognitive outcomes? In this review, we present causal directed acyclic graphs (DAGs) to a paediatric audience. DAGs are a graphical tool which provide a way to visually represent and better understand the key concepts of exposure, outcome, causation, confounding, and bias. We use clinical examples, including those outlined above, framed in the language of DAGs, to demonstrate their potential applications. We show how DAGs can be most useful in identifying confounding and sources of bias, demonstrating inappropriate statistical adjustments for presumed biases, and understanding threats to validity in randomised controlled trials. We believe that a familiarity with DAGs, and the concepts underlying them, will be of benefit both to the researchers planning studies, and practising clinicians interpreting them.

References 67

1. 1.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

2. 2.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

3. 3.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

4. 4.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

5. 5.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

6. 6.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

7. 7.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

8. 8.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

9. 9.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

10. 10.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

11. 11.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

12. 12.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

13. 13.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

14. 14.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

15. 15.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

16. 16.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

17. 17.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

18. 18.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

19. 19.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

20. 20.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

21. 21.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

22. 22.
    Reducing bias through directed acyclic graphs · 2008

    No notice
23. 23.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

24. 24.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

25. 25.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

26. 26.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

27. 27.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

28. 28.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

29. 29.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

30. 30.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

31. 31.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

32. 32.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

33. 33.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

34. 34.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

35. 35.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

36. 36.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

37. 37.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

38. 38.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

39. 39.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

40. 40.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

Reads

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.