Summary Sampling from locally-defined joint distribution via distributed algorithms: LubyGlauber:O(Alog n)rounds under Dobrushin condition; ● LocalMetropolis:may achieve O(log n)rounds; (log n)lower bound for sampling from almost all nontrivial joint distributions; .(diam)lower bound for sampling from joint distributions exhibiting(non-uniqueness)phase transition property. Weiming Feng,Yuxin Sun,Yitong Yin.What can be sampled locally? InP0DC'17.arxiv:1702.00142Summary • Sampling from locally-defined joint distribution via distributed algorithms: • LubyGlauber: O(∆log n) rounds under Dobrushin condition; • LocalMetropolis: may achieve O(log n) rounds; • Ω(log n) lower bound for sampling from almost all nontrivial joint distributions; • Ω(diam) lower bound for sampling from joint distributions exhibiting (non-uniqueness) phase transition property. Weiming Feng, Yuxin Sun, Yitong Yin. What can be sampled locally? In PODC’17. arxiv: 1702.00142