Computationally Efficient Algorithms for Simulating Isotropic Gaussian Random Fields on Graphs with Euclidean Edges
From MaRDI portal
Publication:6532246
arXiv2404.17491MaRDI QIDQ6532246
Emilio Porcu, Alfredo Alegria, Tobia Filosi, Xavier Emery
Has companion code repository: https://github.com/alfredoalegria/fastsimnetworks
This page was built for publication: Computationally Efficient Algorithms for Simulating Isotropic Gaussian Random Fields on Graphs with Euclidean Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6532246)
