Jump around: Selecting Markov Chain Monte Carlo parameters and diagnostics for improved food web model quality and ecosystem representation

Gerber, G. ORCID: https://orcid.org/0000-0002-8722-3113 & Scharler, U. (2024). Jump around: Selecting Markov Chain Monte Carlo parameters and diagnostics for improved food web model quality and ecosystem representation. Ecological Informatics 84 e102865. 10.1016/j.ecoinf.2024.102865.

Preview

Text 1-s2.0-S1574954124004072-main.pdf - Published Version Available under License Creative Commons Attribution. Download (15MB) | Preview

Abstract

Capturing ecological data variability in food web models is an important step for improving model representation of empirical systems. One approach is to use linear inverse modelling and Markov Chain Monte Carlo (LIMMCMC) techniques to set up an inverse LIM problem using empirical data constraints, and then sample multiple plausible food webs from the inverse problem using an MCMC algorithm. We describe the set of plausible food webs as an 'ensemble' of solutions to the inverse problem sampled with the LIM-MCMC algorithm. The extent of data variability eventually integrated into an ensemble depends on how well the LIM-MCMC algorithm samples the solution space. Algorithm quality can be adjusted via user-defined parameters describing starting points, jump sizes, and number of iterations or food webs produced. However, little information exists on how each LIMMCMC algorithm parameter affects the degree of empirical data variability introduced into the ensemble. Further, post hoc algorithm quality diagnostics with commonly used trace plots and the coefficient of variation (CoV) rarely address critical aspects of algorithm quality, such as (1) if the returned ensemble successfully targeted the solution space distribution (stationarity), (2) correlation between ensemble solutions (mixing), and (3) if the ensemble contains enough solutions to adequately capture input data variability (sampling efficiency). Therefore, we used several established MCMC convergence diagnostics to (1) quantify how algorithm parameters affect ensemble flow values and if these differences propagate to ecological indicators and (2) evaluate algorithm quality and compare to current evaluation and ecosystem modelling methods. We applied 30 LIM-MCMC algorithm combinations of varying starting points, jump sizes, and number of iterations to solve food web ensembles from a single food web model. We analysed ensembles with Ecological Network Analysis (ENA) to calculate indicators describing system function. Results show that LIM-MCMC algorithm parameters, in particular the jump size, affect ensemble flow values, which propagate to ecological indicators describing different ecosystem function of the same model. Thereafter, comparisons of post hoc diagnostics show that MCMC convergence diagnostics provided more robust estimates of algorithm quality than trace plots and CoV. Together, these findings underpin several novel recommendations to enhance LIM-MCMC algorithm parameter selection and quality assessments applicable to any ecological ensemble network study.

Actions (login required)

View Item