activity
20112026
most citedA Gibbs sampler on the -simplex

14 citations · 37 across the 19 of their papers we have counts for

collaborators

30 papers

math.PR2026

On the Pseudo-Mixing of Kac's Walk

Natesh S. Pillai, Aaron Smith, Vinod Vaikuntanathan

Motivated by a conjecture of Vaikuntanathan and Zamir, we study the pseudo-mixing of Kac's walk on : whether short trajectories are indistinguishable from Haar meas…

math.ST2021

Consistency of Spectral Seriation

Amine Natik, Aaron Smith

Consider a random graph of size constructed according to a \textit{graphon} as follows. First embed vertices $V = \{v_1, v_2, \ldots…

stat.CO2021★ 1 cited

Rapid Convergence of Informed Importance Tempering

Quan Zhou, Aaron Smith

Informed Markov chain Monte Carlo (MCMC) methods have been proposed as scalable solutions to Bayesian posterior computation on high-dimensional discrete state spaces, but theoretic…

math.ST2020

Existence of matching priors on compact spaces

Haosui Duanmu, Daniel M. Roy, Aaron Smith

A matching prior at level is a prior such that an associated credible set is also a confidence set. We study the existence of matching priors for general families…

math.PR2020

Nonstandard Representation of the Dirichlet Form

Robert M. Anderson, Haosui Duanmu, Aaron Smith

The Dirichlet form is a generalization of the Laplacian, heavily used in the study of many diffusion-like processes. In this paper we present a nonstandard representation theorem f…

stat.CO2020★ 5 cited

No Free Lunch for Approximate MCMC

James E. Johndrow, Natesh S. Pillai, Aaron Smith

It is widely known that the performance of Markov chain Monte Carlo (MCMC) can degrade quickly when targeting computationally expensive posterior distributions, such as when the sa…