2 citations · 3 across the 3 of their papers we have counts for
7 papers
Repeated Averages on Graphs
Ramis Movassagh, Mario Szegedy, Guanyang Wang
Sourav Chatterjee, Persi Diaconis, Allan Sly and Lingfu Zhang, prompted by a question of Ramis Movassagh, renewed the study of a process proposed in the early 1980s by Jean Bourgai…
Discussion of `A Gibbs sampler for a class of random convex polytopes'
Persi Diaconis, Guanyang Wang
This is a contribution for the discussion on "A Gibbs sampler for a class of random convex polytopes" by Pierre E. Jacob, Ruobin Gong, Paul T. Edlefsen and Arthur P. Dempster to ap…
Maximal couplings of the Metropolis-Hastings algorithm
John O'Leary, Guanyang Wang, Pierre E. Jacob
Couplings play a central role in the analysis of Markov chain Monte Carlo algorithms and appear increasingly often in the algorithms themselves, e.g. in convergence diagnostics, pa…
A Fast MCMC for the Uniform Sampling of Binary Matrices with Fixed Margins
Guanyang Wang
Uniform sampling of binary matrix with fixed margins is an important and difficult problem in statistics, computer science, ecology and so on. The well-known swap algorithm would b…
A Multi-armed Bandit MCMC, with applications in sampling from doubly intractable posterior
Guanyang Wang
Markov chain Monte Carlo (MCMC) algorithms are widely used to sample from complicated distributions, especially to sample from the posterior distribution in Bayesian inference. How…
Expectation of the Largest bet size in Labouchere System
Yanjun Han, Guanyang Wang
For Labouchere system with winning probability at each coup, we prove that the expectation of the largest bet size under any initial list is finite if , and is i…