EUVIMEDAtrasti EUVIMED
Open access · CC BY 4.0

Shortest path or random walks? A framework for path weights in network meta‐analysis

Gerta Rücker iD, Theodoros Papakonstantinou, Adriani Nikolakopoulou, Guido Schwarzer, Tobias Galla, Annabel L Davies

Statistics in Medicine · 2024

DOI: 10.1002/sim.10177 ↗

At a glance

Journal article in Statistics in Medicine, 2024. Written by Gerta Rücker and 5 co-authors. Institution: Institute of Medical Biometry and Statistics, Medical Faculty and Medical Center - University of Freiburg, Freiburg, Germany. Cited 9 times so far (Crossref); 21 references. The full text is freely available (open access, CC BY 4.0). Funded by: Deutsche Forschungsgemeinschaft, Engineering and Physical Sciences Research Council.

SantraukaSubjectsBibliografiniai duomenysCiteRelated studies

Abstract (original language)

Quantifying the contributions, or weights, of comparisons or single studies to the estimates in a network meta‐analysis (NMA) is an active area of research. We extend this work to include the contributions of paths of evidence. We present a general framework, based on the path‐design matrix, that describes the problem of finding path contributions as a linear equation. The resulting solutions may have negative coefficients. We show that two known approaches, called shortestpath and randomwalk, are special solutions of this equation, and both meet an optimization criterion, as they minimize the sum of absolute path contributions. In general, there is an infinite set of solutions, which can be identified using the generalized inverse (Moore‐Penrose pseudoinverse). We consider two further special approaches. For large networks we find that shortestpath is superior with respect to run time and variability, compared to the other approaches, and is thus recommended in practice. The path‐weights framework also has the potential to answer more general research questions in NMA.

Subjects

MeSH terms (MEDLINE)

HumansModels, StatisticalComputer SimulationNetwork Meta-Analysis as Topic

Author keywords

contributionsnetwork meta‐analysispathsrandom walks

Authors and institutions

  • Institute of Medical Biometry and Statistics, Medical Faculty and Medical Center - University of Freiburg, Freiburg, Germany.
  • Instituto de Física Interdisciplinar y Sistemas Complejos, IFISC (CSIC-UIB), Campus Universitat Illes Balears, Palma de Mallorca, Spain.
  • Bristol Medical School, University of Bristol, Bristol, UK.

ORCID profiles: Gerta Rücker

Funding

  • Deutsche Forschungsgemeinschaft
  • Engineering and Physical Sciences Research Council

Cite

APA

Rücker, G., Papakonstantinou, T., Nikolakopoulou, A., Schwarzer, G., Galla, T., & Davies, A. L. (2024). Shortest path or random walks? A framework for path weights in network meta‐analysis. Statistics in Medicine. https://doi.org/10.1002/sim.10177

Vancouver

Rücker G, Papakonstantinou T, Nikolakopoulou A, Schwarzer G, Galla T, Davies AL. Shortest path or random walks? A framework for path weights in network meta‐analysis. Statistics in Medicine. 2024. doi:10.1002/sim.10177

BibTeX
@article{Rcker2024,
  author = {Rücker, Gerta and Papakonstantinou, Theodoros and Nikolakopoulou, Adriani and Schwarzer, Guido and Galla, Tobias and Davies, Annabel L},
  title = {Shortest path or random walks? A framework for path weights in network meta‐analysis},
  journal = {Statistics in Medicine},
  year = {2024},
  doi = {10.1002/sim.10177}
}
Start for free →