2019 - Fellow of the American Mathematical Society For contributions to theoretical computer science, in particular through its interactions with probability, combinatorics and statistical physics and for service to the profession.
Eric Vigoda focuses on Combinatorics, Markov chain Monte Carlo, Discrete mathematics, Glauber and Independent set. His biological study spans a wide range of topics, including Uniqueness and Ising model. His research investigates the connection between Markov chain Monte Carlo and topics such as Algorithm that intersect with problems in Posterior probability and Tree.
His Discrete mathematics research is multidisciplinary, relying on both Degree, Minimax approximation algorithm and Computing the permanent. His Minimax approximation algorithm study combines topics in areas such as Scheme, Polynomial time approximation algorithm and Polynomial-time approximation scheme. His Independent set research is multidisciplinary, incorporating perspectives in Distribution, Hardness of approximation and Vertex.
His primary areas of study are Combinatorics, Discrete mathematics, Uniqueness, Ising model and Glauber. The study of Combinatorics is intertwined with the study of Mixing in a number of ways. His Discrete mathematics research incorporates themes from Upper and lower bounds, Graph and Markov chain mixing time.
His study explores the link between Uniqueness and topics such as Independent set that cross with problems in Hardness of approximation. His work deals with themes such as Fixed point and Spectral gap, which intersect with Ising model. The Adaptive simulated annealing study combines topics in areas such as Discrete system and Markov chain Monte Carlo.
Eric Vigoda mostly deals with Combinatorics, Ising model, Bipartite graph, Uniqueness and Potts model. Combinatorics is closely attributed to Mixing in his work. Eric Vigoda has researched Ising model in several fields, including Polynomial and Random graph.
His research integrates issues of Time complexity and Partition function in his study of Bipartite graph. His Time complexity study is concerned with Discrete mathematics in general. His study in Uniqueness is interdisciplinary in nature, drawing from both Tree, Independent set, Spectral gap and Tree.
His scientific interests lie mostly in Combinatorics, Uniqueness, Glauber, Ising model and Lambda. His study on Combinatorics is mostly dedicated to connecting different topics, such as Mixing. His research investigates the connection with Uniqueness and areas like Tree which intersect with concerns in Spectral gap.
His work carried out in the field of Ising model brings together such families of science as Polynomial and Random graph. His Polynomial research is multidisciplinary, incorporating perspectives in Discrete mathematics, Distribution, Exponential time hypothesis and Boundary value problem. His studies in Random graph integrate themes in fields like Time complexity and Bipartite graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Mark Jerrum;Alistair Sinclair;Eric Vigoda.
Journal of the ACM (2004)
Improved bounds for sampling colorings
Journal of Mathematical Physics (2000)
Phylogenetic MCMC Algorithms Are Misleading on Mixtures of Trees
Elchanan Mossel;Elchanan Mossel;Eric Vigoda;Eric Vigoda.
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Mark Jerrum;Alistair Sinclair;Eric Vigoda.
symposium on the theory of computing (2001)
Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics
C. Borgs;J.T. Chayes;A. Frieze;Jeong Han Kim.
foundations of computer science (1999)
Fast convergence of the Glauber dynamics for sampling independent sets
Michael Luby;Eric Vigoda;Eric Vigoda.
Random Structures and Algorithms (1999)
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
Ivona Bezáková;Daniel Štefankovič;Vijay V. Vazirani;Eric Vigoda.
SIAM Journal on Computing (2008)
Mixing in time and space for lattice spin systems: A combinatorial view
Martin Dyer;Alistair Sinclair;Eric Vigoda;Dror Weitz.
Random Structures and Algorithms (2004)
Heterogeneous genomic molecular clocks in primates.
Seong-Ho Kim;Navin Elango;Charles David Warden;Eric Vigoda.
PLOS Genetics (2005)
A non-Markovian coupling for randomly sampling colorings
T.P. Hayes;E. Vigoda.
foundations of computer science (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: