Counting independent sets up to the tree threshold

By Dror Weitz. Symposium on the Theory of Computing, 2006

482 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/65eb5804db0f00d786acbbe0c3168690e46443f9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Johan Wästlund
2. Mathias Niepert
3. Svante Janson
4. Cecilia Holmgren
5. Terence Tao
6. Ben Joseph Green

In Geometry and Topology

1. Johan Wästlund
2. Mathias Niepert
3. Svante Janson
4. Cecilia Holmgren
5. Terence Tao
6. Ben Joseph Green

In Statistics and Probability

1. Johan Wästlund
2. Mathias Niepert

Citations in the corpus

• Markov Chains on Orbits of Permutation Groups (2012, background): “Sampling independent sets is a classical problem motivated by numerous applications and with a considerable amount of recent research devoted to it [24, 13, 45, 42, 37].”
• The mean field traveling salesman and related problems (2010, background): “Some important achievements in this direction are David Aldous’ proof of the ζ(2) limit in the assignment problem [6], Michel Talagrand’s proof of the correctness of the Parisi solution of the Sherrington-Kirkpatrick model [19, 34, 40, 44], and the algorithmic and theoretical results on phase transi”