On Local Distributed Sampling and Counting

DOI10.1145/3212734.3212757zbMath1428.68374arXiv1802.06686OpenAlexW2962969574MaRDI QIDQ5197683

Yitong Yin, Weiming Feng

Publication date: 19 September 2019

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

Full work available at URL: https://arxiv.org/abs/1802.06686

zbMATH Keywords

Gibbs distributionlocal computationsampling algorithmsdistributed graph algorithmsstrong spatial mixing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (4)

Perfect sampling for Gibbs point processes using partial rejection sampling ⋮ Perfect sampling from spatial mixing ⋮ What can be sampled locally? ⋮ Exact distributed sampling

This page was built for publication: On Local Distributed Sampling and Counting