What Can be Sampled Locally?

DOI10.1145/3087801.3087815MaRDI QIDQ5368952zbMATH OpenOpenAlexFDO

Authors Weiming Feng, Yitong Yin, Yuxin Sun

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://link.springer.com/article/10.1007/s00446-018-0332-8

zbMATH Keywords

distributed sampling algorithmsGibbs samplinglocal computationlocal modelMarkov chain Monte Carlo

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Distributed algorithms (68W15)

Recommendations

• What can be sampled locally?
• What can be verified locally?
• What can be verified locally?
• What Can be Computed Locally?
• Computational Science - ICCS 2004
• What can be decided locally without identifiers?
• Can Distributed Uniformity Testing Be Local?
• Localized sampling in the presence of noise
• What cannot be computed locally!
• scientific article; zbMATH DE number 19478

Cited in

(7)

• Perfect sampling for Gibbs point processes using partial rejection sampling
• What can be sampled locally?
• What Can be Computed Locally?
• scientific article; zbMATH DE number 7561278 (Why is no real title available?)
• What can be decided locally without identifiers?
• Parallelize single-site dynamics up to Dobrushin criterion
• Sampling and output estimation in distributed algorithms and LCAs

This page was built for publication: What Can be Sampled Locally?

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