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

DOI10.1002/SIM.10177MaRDI QIDQ6652593zbMATH OpenFDO

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

Publication date 12 December 2024

Published in Statistics in Medicine (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/SIM.10177

zbMATH Keywords

contributionsnetwork meta-analysispathsrandom walks

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10)

Cites work

• Constructing maximal dynamic flows from static flows
• Network meta-analysis and random walks
• Regression and the Moore-Penrose pseudoinverse
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.

This page was built for publication: Shortest path or random walks? A framework for path weights in network meta-analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652593)