THThomas P. Hayes

Thomas P. Hayes

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thomas P. Hayes has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Distributed Metropolis Sampler with Optimal Parallelism

    by Weiming Feng, Thomas P. Hayes, Yitong Yin

    The Metropolis-Hastings algorithm is a fundamental Markov chain Monte Carlo (MCMC) method for sampling and inference. With the advent of Big Data, distributed and parallel variants of MCMC methods are attracting increased attention. In this paper, we give a distributed algorithm that can correctly simulate sequential single-site Metropolis chains without any bias in a fully asynchronous message-passing model. Furthermore, if a natural Lipschitz condition is satisfied by the Metropolis filters, our algorithm can simulate $N$-step Metropolis chains within $O(N/n+\log n)$ rounds of asynchronous communications, where $n$ is the number of variables. For sequential single-site dynamics, whose mixing requires $\Omega(n\log n)$ steps, this achieves an optimal linear speedup. For several well-studied important graphical models, including proper graph coloring, hardcore model, and Ising model, our condition for linear speedup is weaker than the respective uniqueness (mixing) conditions. The novel idea in our algorithm is to resolve updates in advance: the local Metropolis filters can often be executed correctly before the full information about neighboring spins is available. This achieves optimal parallelism without introducing any bias.

  • Interactive communication with unknown noise rate

    by Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young


  • Open Access

    Distributed Symmetry Breaking in Sampling (Optimal Distributed Randomly Coloring with Fewer Colors)

    by Weiming Feng, Thomas P. Hayes, Yitong Yin

    We examine the problem of almost-uniform sampling proper $q$-colorings of a graph whose maximum degree is $\Delta$. A famous result, discovered independently by Jerrum(1995) and Salas and Sokal(1997), is that, assuming $q > (2+\delta) \Delta$, the Glauber dynamics (a.k.a. single-site dynamics) for this problem has mixing time $O(n \log n)$, where $n$ is the number of vertices, and thus provides a nearly linear time sampling algorithm for this problem. A natural question is the extent to which this algorithm can be parallelized. Previous work Feng, Sun and Yin [PODC'17] has shown that a $O(\Delta \log n)$ time parallelized algorithm is possible, and that $\Omega(\log n)$ time is necessary. We give a distributed sampling algorithm, which we call the Lazy Local Metropolis Algorithm, that achieves an optimal parallelization of this classic algorithm. It improves its predecessor, the Local Metropolis algorithm of Feng, Sun and Yin [PODC'17], by introducing a step of distributed symmetry breaking that helps the mixing of the distributed sampling algorithm. For sampling almost-uniform proper $q$-colorings of graphs $G$ on $n$ vertices, we show that the Lazy Local Metropolis algorithm achieves an optimal $O(\log n)$ mixing time if either of the following conditions is true for an arbitrary constant $\delta>0$: $\bullet$ $q\ge(2+\delta)\Delta$, on general graphs with maximum degree $\Delta$; $\bullet$ $q \geq (\alpha^* + \delta)\Delta$, where $\alpha^* \approx 1.763$ satisfies $\alpha^* = \mathrm{e}^{1/\alpha^*}$, on graphs with sufficiently large maximum degree $\Delta\ge \Delta_0(\delta)$ and girth at least $9$.


  • Open Access

    Distributed Computing with Channel Noise

    by Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia

    A group of $n$ users want to run a distributed protocol $\pi$ over a network where communication occurs via private point-to-point channels. Unfortunately, an adversary, who knows $\pi$, is able to maliciously flip bits on the channels. Can we efficiently simulate $\pi$ in the presence of such an adversary? We show that this is possible, even when $L$, the number of bits sent in $\pi$, and $T$, the number of bits flipped by the adversary are not known in advance. In particular, we show how to create a robust version of $\pi$ that 1) fails with probability at most $\delta$, for any $\delta>0$; and 2) sends $\tilde{O}(L + T)$ bits, where the $\tilde{O}$ notation hides a $\log (nL/ \delta)$ term multiplying $L$. Additionally, we show how to improve this result when the average message size $\alpha$ is not constant. In particular, we give an algorithm that sends $O( L (1 + (1/\alpha) \log (n L/\delta) + T)$ bits. This algorithm is adaptive in that it does not require a priori knowledge of $\alpha$. We note that if $\alpha$ is $\Omega\left( \log (n L/\delta) \right)$, then this improved algorithm sends only $O(L+T)$ bits, and is therefore within a constant factor of optimal.

  • Open Access

    Sampling Random Colorings of Sparse Random Graphs

    by Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda

    We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sampling $k$-colorings of a sparse random graph $G(n,d/n)$ for constant $d$. The best known rapid mixing results for general graphs are in terms of the maximum degree $\Delta$ of the input graph $G$ and hold when $k>11\Delta/6$ for all $G$. Improved results hold when $k>\alpha\Delta$ for graphs with girth $\geq 5$ and $\Delta$ sufficiently large where $\alpha\approx 1.7632\ldots$ is the root of $\alpha=\exp(1/\alpha)$; further improvements on the constant $\alpha$ hold with stronger girth and maximum degree assumptions. For sparse random graphs the maximum degree is a function of $n$ and the goal is to obtain results in terms of the expected degree $d$. The following rapid mixing results for $G(n,d/n)$ hold with high probability over the choice of the random graph for sufficiently large constant~$d$. Mossel and Sly (2009) proved rapid mixing for constant $k$, and Efthymiou (2014) improved this to $k$ linear in~$d$. The condition was improved to $k>3d$ by Yin and Zhang (2016) using non-MCMC methods. Here we prove rapid mixing when $k>\alpha d$ where $\alpha\approx 1.7632\ldots$ is the same constant as above. Moreover we obtain $O(n^{3})$ mixing time of the Glauber dynamics, while in previous rapid mixing results the exponent was an increasing function in $d$. As in previous results for random graphs our proof analyzes an appropriately defined block dynamics to "hide" high-degree vertices. One new aspect in our improved approach is utilizing so-called local uniformity properties for the analysis of block dynamics. To analyze the "burn-in" phase we prove a concentration inequality for the number of disagreements propagating in large blocks.

  • Codes, lower bounds, and phase transitions in the symmetric rendezvous problem

    by Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell


  • Open Access

    Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem

    by Varsha Dani, Thomas P. Hayes, Cristopher Moore, Alexander Russell

    In the rendezvous problem, two parties with different labelings of the vertices of a complete graph are trying to meet at some vertex at the same time. It is well-known that if the parties have predetermined roles, then the strategy where one of them waits at one vertex, while the other visits all $n$ vertices in random order is optimal, taking at most $n$ steps and averaging about $n/2$. Anderson and Weber considered the symmetric rendezvous problem, where both parties must use the same randomized strategy. They analyzed strategies where the parties repeatedly play the optimal asymmetric strategy, determining their role independently each time by a biased coin-flip. By tuning the bias, Anderson and Weber achieved an expected meeting time of about $0.829 n$, which they conjectured to be asymptotically optimal. We change perspective slightly: instead of minimizing the expected meeting time, we seek to maximize the probability of meeting within a specified time $T$. The Anderson-Weber strategy, which fails with constant probability when $T= \Theta(n)$, is not asymptotically optimal for large $T$ in this setting. Specifically, we exhibit a symmetric strategy that succeeds with probability $1-o(1)$ in $T=4n$ steps. This is tight: for any $\alpha < 4$, any symmetric strategy with $T = \alpha n$ fails with constant probability. Our strategy uses a new combinatorial object that we dub a "rendezvous code," which may be of independent interest. When $T \le n$, we show that the probability of meeting within $T$ steps is indeed asymptotically maximized by the Anderson-Weber strategy. Our results imply new lower bounds, showing that the best symmetric strategy takes at least $0.638 n$ steps in expectation. We also present some partial results for the symmetric rendezvous problem on other vertex-transitive graphs.

  • Open Access

    Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

    by Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda, Yitong Yin

    We study the hard-core model defined on independent sets of an input graph where the independent sets are weighted by a parameter $\lambda>0$. For constant $\Delta$, previous work of Weitz (2006) established an FPTAS for the partition function for graphs of maximum degree $\Delta$ when $\lambda< \lambda_c(\Delta)$. The threshold $\lambda_c(\Delta)$ is the critical point for the phase transition for uniqueness/non-uniqueness on the infinite $\Delta$-regular trees. Sly (2010) showed that there is no FPRAS, unless NP=RP, when $\lambda>\lambda_c(\Delta)$. The running time of Weitz's algorithm is exponential in $\log(\Delta)$. Here we present an FPRAS for the partition function whose running time is $O^*(n^2)$. We analyze the simple single-site Glauber dynamics for sampling from the associated Gibbs distribution. We prove there exists a constant $\Delta_0$ such that for all graphs with maximum degree $\Delta\geq\Delta_0$ and girth $\geq 7$, the mixing time of the Glauber dynamics is $O(n\log(n))$ when $\lambda<\lambda_c(\Delta)$. Our work complements that of Weitz which applies for constant $\Delta$ whereas our work applies for all $\Delta \geq \Delta_0$. We utilize loopy BP (belief propagation), a widely-used inference algorithm. A novel aspect of our work is using the principal eigenvector for the BP operator to design a distance function which contracts in expectation for pairs of states that behave like the BP fixed point. We also prove that the Glauber dynamics behaves locally like loopy BP. As a byproduct we obtain that the Glauber dynamics converges, after a short burn-in period, close to the BP fixed point, and this implies that the fixed point of loopy BP is a close approximation to the Gibbs distribution. Using these connections we establish that loopy BP quickly converges to the Gibbs distribution when the girth $\geq 6$ and $\lambda<\lambda_c(\Delta)$.

  • Open Access

    Interactive Communication with Unknown Noise Rate

    by Varsha Dani, Thomas P. Hayes, Mahnush Movahedi, Jared Saia, Maxwell Young

    Alice and Bob want to run a protocol over a noisy channel, where a certain number of bits are flipped adversarially. Several results take a protocol requiring $L$ bits of noise-free communication and make it robust over such a channel. In a recent breakthrough result, Haeupler described an algorithm that sends a number of bits that is conjectured to be near optimal in such a model. However, his algorithm critically requires $a \ priori$ knowledge of the number of bits that will be flipped by the adversary. We describe an algorithm requiring no such knowledge. If an adversary flips $T$ bits, our algorithm sends $L + O\left(\sqrt{L(T+1)\log L} + T\right)$ bits in expectation and succeeds with high probability in $L$. It does so without any $a \ priori$ knowledge of $T$. Assuming a conjectured lower bound by Haeupler, our result is optimal up to logarithmic factors. Our algorithm critically relies on the assumption of a private channel. We show that privacy is necessary when the amount of noise is unknown.

  • Open Access

    Spatial Mixing for Independent Sets in Poisson Random Trees

    by Varsha Dani, Thomas P. Hayes, Cristopher Moore

    We consider correlation decay in the hard-core model with fugacity $\lambda$ on a rooted tree $T$ in which the arity of each vertex is independently Poisson distributed with mean $d$. Specifically, we investigate the question of which parameter settings $(d, \lambda)$ result in strong spatial mixing, weak spatial mixing, or neither. (In our context, weak spatial mixing is equivalent to Gibbs uniqueness.) For finite fugacity, a zero-one law implies that these spatial mixing properties hold either almost surely or almost never, once we have conditioned on whether $T$ is finite or infinite. We provide a partial answer to this question, which implies in particular that 1. As $d \to \infty$, weak spatial mixing on the Poisson tree occurs whenever $\lambda < f(d) - o(1)$ but not when $\lambda$ is slightly above $f(d)$, where $f(d)$ is the threshold for WSM (and SSM) on the $d$-regular tree. This suggests that, in most cases, Poisson trees have similar spatial mixing behavior to regular trees. 2. When $1 < d \le 1.179$, there is weak spatial mixing on the Poisson($d$) tree for all values of $\lambda$. However, strong spatial mixing does not hold for sufficiently large $\lambda$. This is in contrast to regular trees, for which strong spatial mixing and weak spatial mixing always coincide. For infinite fugacity SSM holds only when the tree is finite, and hence almost surely fails on the Poisson($d$) tree when $d>1$. We show that WSM almost surely holds on the Poisson($d$) tree for $d < \mathbf{e}^{1/\sqrt{2}}/\sqrt{2} =1.434...$, but that it fails with positive probability if $d>\mathbf{e}$.