56 citations · 184 across the 20 of their papers we have counts for
26 papers
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
Charilaos Efthymiou, Thomas P. Hayes, Daniel Stefankovic +1
We study the mixing time of the single-site update Markov chain, known as the Glauber dynamics, for generating a random independent set of a tree. Our focus is obtaining optimal co…
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks
Varsha Dani, Thomas P. Hayes
Recent work has shown that it is sometimes feasible to significantly reduce the energy usage of some radio-network algorithms by adaptively powering down the radio receiver when it…
Reconstruction of Random Geometric Graphs: Breaking the Omega(r) distortion barrier
Varsha Dani, Josep Díaz, Thomas P. Hayes +1
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network an…
Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks
Varsha Dani, Aayush Gupta, Thomas P. Hayes +1
We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for suc…
The Energy Complexity of BFS in Radio Networks
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes +1
We consider a model of energy complexity in Radio Networks in which transmitting or listening on the channel costs one unit of energy and computation is free. This simplified model…
Improved Strong Spatial Mixing for Colorings on Trees
Charilaos Efthymiou, Andreas Galanis, Thomas P. Hayes +2
Strong spatial mixing (SSM) is a form of correlation decay that has played an essential role in the design of approximate counting algorithms for spin systems. A notable example is…