Results 191 to 200 of about 174,528 (270)

Addressing spatial confounding in geostatistical regression models: An R‐INLA approach

open access: yesMethods in Ecology and Evolution, EarlyView.
Abstract Spatial confounding, which has been studied extensively in recent years, can explain inconsistencies between results obtained by regression models with and without spatial modelling. While the most common solutions for spatial confounding mitigation often target areal data or geostatistical data modelling by splines, we aim to extend some ...
Jérémy Lamouroux   +4 more
wiley   +1 more source

Quantifying functionally equivalent species and ecological network dissimilarity with optimal transport distances

open access: yesMethods in Ecology and Evolution, EarlyView.
Abstract Quantifying the structure and dynamics of species interactions in ecological communities is fundamental to studying ecology and evolution. While there are numerous approaches to analysing ecological networks, there is not yet an approach that can (1) quantify dissimilarity in the global structure of ecological networks that range from ...
Kai M. Hung   +4 more
wiley   +1 more source

Entropies of the Classical Dimer Model. [PDF]

open access: yesEntropy (Basel)
Baker JC, Bishop MF, McMullen T.
europepmc   +1 more source

Solving three core challenges in transient dynamics analysis of matrix population models

open access: yesMethods in Ecology and Evolution, EarlyView.
Abstract Populations are at the mercy of random disturbances, large and small, and rarely, if ever, converge on predicted long‐term behaviours. Therefore, when using matrix population models, ecologists study the dynamics of populations that depart from stable distributions.
Richard A. Hinrichsen
wiley   +1 more source

On the diversity of test instances for studying branch‐and‐bound performance

open access: yesAustralian &New Zealand Journal of Statistics, EarlyView.
Summary In their paper ‘An Automatic Method for Solving Discrete Programming Problems’, Ailsa Land and Alison Doig developed a branch‐and‐bound method for solving the general case of the mixed integer linear programming (MIP) problem. A core part of the algorithm, branch variable selection, has received renewed attention in recent years with the ...
Simon Bowly, Kate Smith‐Miles
wiley   +1 more source

Home - About - Disclaimer - Privacy