{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T06:49:40Z","timestamp":1792046980990,"version":"4.4.0"},"reference-count":33,"publisher":"Cambridge University Press (CUP)","license":[{"start":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T00:00:00Z","timestamp":1792022400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/Y007905\/1"],"award-info":[{"award-number":["EP\/Y007905\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Res. synth. methods"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We show that the covariance matrix of the treatment effect estimates in a network meta-analysis can be obtained without matrix inversion using a geometric series of diffusion matrices. This property extends to the hat matrix and provides a connection between parameter estimation in regression analysis and random walks on the network graph. We also provide a number of visualization tools implemented in R.<\/jats:p>","DOI":"10.1017\/rsm.2026.10123","type":"journal-article","created":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T06:34:01Z","timestamp":1792046041000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Network meta-analysis and diffusion"],"prefix":"10.1017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2192-2560","authenticated-orcid":false,"given":"Gerta","family":"R\u00fccker","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03vzbgh69","id-type":"ROR","asserted-by":"publisher"}],"name":"Medical Center \u2013 University of Freiburg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2320-7701","authenticated-orcid":false,"given":"Annabel Louisa","family":"Davies","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/0524sp257","id-type":"ROR","asserted-by":"publisher"}],"name":"University of Bristol"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6214-9087","authenticated-orcid":false,"given":"Guido","family":"Schwarzer","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/03vzbgh69","id-type":"ROR","asserted-by":"publisher"}],"name":"Medical Center \u2013 University of Freiburg"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2026,10,15]]},"reference":[{"key":"S1759287926101239_r6","doi-asserted-by":"publisher","DOI":"10.32614\/CRAN.package.metabook"},{"key":"S1759287926101239_r21","first-page":"312","article-title":"Network analysis using Krylov subspace trajectories","volume":"1187","author":"Frost","year":"2025","journal-title":"Complex Network Applications"},{"key":"S1759287926101239_r32","doi-asserted-by":"publisher","DOI":"10.1093\/jrsssa\/qnag012"},{"key":"S1759287926101239_r4","unstructured":"[4] R\u00fccker, G , Krahn, U , K\u00f6nig, J , et al. netmeta: network meta-analysis using frequentist methods. R package version 3.6-1. 2026. https:\/\/cran.r-project.org\/web\/packages\/netmeta\/."},{"key":"S1759287926101239_r2","doi-asserted-by":"publisher","DOI":"10.1002\/sim.6236"},{"key":"S1759287926101239_r3","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v106.i02"},{"key":"S1759287926101239_r15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01172931"},{"key":"S1759287926101239_r28","doi-asserted-by":"publisher","DOI":"10.1002\/sim.10177"},{"key":"S1759287926101239_r20","doi-asserted-by":"publisher","DOI":"10.1021\/ci00066a017"},{"key":"S1759287926101239_r33","volume-title":"Markov Chains","author":"Norris","year":"2007"},{"key":"S1759287926101239_r30","doi-asserted-by":"publisher","DOI":"10.3390\/math13152380"},{"key":"S1759287926101239_r26","doi-asserted-by":"publisher","DOI":"10.1002\/sim.6001"},{"key":"S1759287926101239_r1","doi-asserted-by":"publisher","DOI":"10.1002\/jrsm.1700"},{"key":"S1759287926101239_r22","doi-asserted-by":"publisher","DOI":"10.64898\/2026.03.29.715092"},{"key":"S1759287926101239_r12","doi-asserted-by":"publisher","DOI":"10.1201\/b11644-19"},{"key":"S1759287926101239_r14","doi-asserted-by":"publisher","DOI":"10.1002\/sim.9346"},{"key":"S1759287926101239_r25","doi-asserted-by":"publisher","DOI":"10.1002\/sim.3767"},{"key":"S1759287926101239_r24","first-page":"2155","article-title":"Approximate matrix inversion for high-throughput data detection in the large-scale MIMO uplink","author":"Wu","year":"2013","journal-title":"IEEE International Symposium on Circuits and Systems (ISCAS2013)"},{"key":"S1759287926101239_r7","doi-asserted-by":"publisher","DOI":"10.1136\/bmj.d1110"},{"key":"S1759287926101239_r8","doi-asserted-by":"publisher","DOI":"10.1002\/jrsm.1058"},{"key":"S1759287926101239_r27","doi-asserted-by":"publisher","DOI":"10.12688\/f1000research.14770.1"},{"key":"S1759287926101239_r11","volume-title":"Regression and the Moore-Penrose Pseudoinverse","author":"Albert","year":"1972"},{"key":"S1759287926101239_r17","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2635"},{"key":"S1759287926101239_r19","doi-asserted-by":"publisher","DOI":"10.5948\/UPO9781614440222"},{"key":"S1759287926101239_r5","doi-asserted-by":"publisher","DOI":"10.1136\/thoraxjnl-2012-201926"},{"key":"S1759287926101239_r16","doi-asserted-by":"publisher","DOI":"10.1021\/ci00019a010"},{"key":"S1759287926101239_r10","doi-asserted-by":"publisher","DOI":"10.1002\/jrsm.1316"},{"key":"S1759287926101239_r13","unstructured":"[13] Spielman, DA . Spectral and algebraic graph theory. Tech. Rep. New Haven, Connecticut, US: Yale University, 2025. http:\/\/cs-www.cs.yale.edu\/homes\/spielman\/sagt\/."},{"key":"S1759287926101239_r31","doi-asserted-by":"publisher","DOI":"10.1002\/jrsm.1743"},{"key":"S1759287926101239_r29","doi-asserted-by":"publisher","DOI":"10.1186\/s12874-020-01075-y"},{"key":"S1759287926101239_r9","doi-asserted-by":"publisher","DOI":"10.1002\/jrsm.1319"},{"key":"S1759287926101239_r18","doi-asserted-by":"publisher","DOI":"10.1093\/biomtc\/ujae112"},{"key":"S1759287926101239_r23","volume-title":"Functional Analysis","author":"Werner","year":"2018"}],"container-title":["Research Synthesis Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1759287926101239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T06:34:04Z","timestamp":1792046044000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1759287926101239\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10,15]]},"references-count":33,"alternative-id":["S1759287926101239"],"URL":"https:\/\/doi.org\/10.1017\/rsm.2026.10123","relation":{},"ISSN":["1759-2879","1759-2887"],"issn-type":[{"value":"1759-2879","type":"print"},{"value":"1759-2887","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,10,15]]},"assertion":[{"value":"\u00a9 The Author(s), 2026. Published by Cambridge University Press on behalf of The Society for Research Synthesis Methodology","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}