Sampling From Gaussian Markov Random Fields Using Stationary and Non-Stationary Subgraph Perturbations

DOI10.1109/TSP.2014.2375134zbMATH Open1394.94342OpenAlexW2082089002MaRDI QIDQ4579707FDOQ4579707

Authors

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2014.2375134

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Random fields; image analysis (62M40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
• Generalized Sampling on Graphs With Subspace and Smoothness Priors
• Fast sampling of Gaussian Markov random fields
• Sampling from Gaussian Markov random fields conditioned on linear constraints
• Stationary random fields over graphs and related structures
• Sampling Strategies for Fast Updating of Gaussian Markov Random Fields
• Sampling graphs with a prescribed joint degree distribution using Markov chains
• Dynamic sampling from graphical models

Cited in

(5)

• Fast sampling of Gaussian Markov random fields
• Sampling Strategies for Fast Updating of Gaussian Markov Random Fields
• Sampling from Gaussian Markov random fields conditioned on linear constraints
• A Metropolis-Hastings based method for sampling from the \(G\)-Wishart distribution in Gaussian graphical models
• Analysis of Circulant Embedding Methods for Sampling Stationary Random Fields

This page was built for publication: Sampling From Gaussian Markov Random Fields Using Stationary and Non-Stationary Subgraph Perturbations

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