Will Perkins

Publication Activity (10 Years)

Years Active: 2010-2022
Publications (10 Years): 39

Top Topics

Bipartite Graph

Satisfiability Problem

Top Venues

Random Struct. Algorithms

Publications

Emma Cohen, Will Perkins, Michail Sarantis, Prasad Tetali
On the number of independent sets in uniform, regular, linear hypergraphs. Eur. J. Comb. 99 (2022)
Antonio Blanca, Sarah Cannon, Will Perkins
Fast and perfect sampling of subgraphs and polymer systems. CoRR (2022)
Marcus Michelen, Will Perkins
Strong spatial mixing for repulsive point processes. CoRR (2022)
Matthew Jenssen, Will Perkins, Aditya Potukuchi
Approximately counting independent sets in bipartite graphs via graph containers. CoRR (2021)
Charlie Carlson, Ewan Davies, Alexandra Kolla, Will Perkins
Computational thresholds for the fixed-magnetization Ising model. CoRR (2021)
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
Fast algorithms at low temperatures via Markov chains. Random Struct. Algorithms 58 (2) (2021)
Ewan Davies, Will Perkins
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. ICALP (2021)
Ewan Davies, Matthew Jenssen, Will Perkins
A proof of the upper matching conjecture for large graphs. J. Comb. Theory, Ser. B 151 (2021)
Will Perkins, Changji Xu
Frozen 1-RSB structure of the symmetric Ising perceptron. STOC (2021)
Tyler Helmuth, Holden Lee, Will Perkins, Mohan Ravichandran, Qiang Wu
Approximation algorithms for the random-field Ising model. CoRR (2021)
Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney
Approximate counting and sampling via local central limit theorems. CoRR (2021)
Ewan Davies, Will Perkins
Approximately counting independent sets of a given size in bounded-degree graphs. CoRR (2021)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-Hard Problems on Expander Graphs. SIAM J. Comput. 49 (4) (2020)
Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures. STOC (2020)
Sarah Cannon, Will Perkins
Counting independent sets in unbalanced bipartite graphs. SODA (2020)
Tyler Helmuth, Will Perkins, Samantha Petti
Correlation decay for hard spheres via Markov chains. CoRR (2020)
Tyler Helmuth, Matthew Jenssen, Will Perkins
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. CoRR (2020)
Sarah Cannon, Will Perkins
Counting independent sets in unbalanced bipartite graphs. CoRR (2019)
Tyler Helmuth, Will Perkins, Guus Regts
Algorithmic Pirogov-Sinai theory. STOC (2019)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-hard problems on expander graphs. SODA (2019)
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, Eric Vigoda
Fast Algorithms at Low Temperatures via Markov Chains. APPROX-RANDOM (2019)
Christian Borgs, Jennifer T. Chayes, Tyler Helmuth, Will Perkins, Prasad Tetali
at all temperatures. CoRR (2019)
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
Tight bounds on the coefficients of partition functions via stability. J. Comb. Theory, Ser. A 160 (2018)
Shelby Heinecke, Will Perkins, Lev Reyzin
On the Resilience of Bipartite Networks. Allerton (2018)
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
Extremes of the internal energy of the Potts model on cubic graphs. Random Struct. Algorithms 53 (1) (2018)
Vitaly Feldman, Will Perkins, Santosh S. Vempala
On the Complexity of Random Satisfiability Problems with Planted Solutions. SIAM J. Comput. 47 (4) (2018)
Guillem Perarnau, Will Perkins
Counting independent sets in cubic graphs of given girth. J. Comb. Theory, Ser. B 133 (2018)
Tyler Helmuth, Will Perkins, Guus Regts
Algorithmic Pirogov-Sinai theory. CoRR (2018)
Matthew Jenssen, Peter Keevash, Will Perkins
Algorithms for #BIS-hard problems on expander graphs. CoRR (2018)
Amin Coja-Oghlan, Will Perkins, Kathrin Skubch
Limits of discrete distributions and Gibbs measures on random graphs. Eur. J. Comb. 66 (2017)
Emma Cohen, Will Perkins, Prasad Tetali
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Comb. Probab. Comput. 26 (2) (2017)
Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. 62 (2017)
Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová
Information-theoretic thresholds from the cavity method. STOC (2017)
Ewan Davies, Matthew Jenssen, Will Perkins, Barnaby Roberts
Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96 (1) (2017)
Ewan Davies, Matthew Jenssen, Barnaby Roberts, Will Perkins
Tight bounds on the coefficients of partition functions via stability. Electron. Notes Discret. Math. 61 (2017)
Amin Coja-Oghlan, Will Perkins
Belief Propagation on Replica Symmetric Random Factor Graph Models. APPROX-RANDOM (2016)
Amin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová
Information-theoretic thresholds from the cavity method. CoRR (2016)
Amin Coja-Oghlan, Will Perkins
Belief Propagation on replica symmetric random factor graph models. CoRR (2016)
Laura Florescu, Will Perkins
Spectral thresholds in the bipartite stochastic block model. COLT (2016)
Vitaly Feldman, Will Perkins, Santosh S. Vempala
On the Complexity of Random Satisfiability Problems with Planted Solutions. STOC (2015)
Vitaly Feldman, Will Perkins, Santosh S. Vempala
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's. NIPS (2015)
Will Perkins
-SAT and the power of two choices. Random Struct. Algorithms 47 (1) (2015)
Laura Florescu, Will Perkins
Spectral Thresholds in the Bipartite Stochastic Block Model. CoRR (2015)
Vitaly Feldman, Will Perkins, Santosh S. Vempala
Subsampled Power Iteration: a New Algorithm for Block Models and Planted CSP's. CoRR (2014)
Vitaly Feldman, Will Perkins, Santosh S. Vempala
On the Complexity of Random Satisfiability Problems with Planted Solutions. Electron. Colloquium Comput. Complex. 21 (2014)
Milan Bradonjic, Will Perkins
On Sharp Thresholds in Random Geometric Graphs. APPROX-RANDOM (2014)
Will Perkins, Lev Reyzin
On the Resilience of Bipartite Networks. CoRR (2013)
Milan Bradonjic, Will Perkins
Thresholds for Random Geometric k-SAT. CoRR (2013)
Vitaly Feldman, Will Perkins, Santosh S. Vempala
On the Complexity of Random Satisfiability Problems with Planted Solutions. CoRR (2013)
Will Perkins
The forgetfulness of balls and bins. Random Struct. Algorithms 42 (2) (2013)
Mihyun Kang, Will Perkins, Joel Spencer
The Bohman-Frieze process near criticality. Random Struct. Algorithms 43 (2) (2013)
Will Perkins
Random k-SAT and the Power of Two Choices CoRR (2012)
Irit Dinur, Subhash Khot, Will Perkins, Muli Safra
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs. FOCS (2010)