Will Perkins

According to our database1, Will Perkins authored at least 30 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Algorithms for #BIS-Hard Problems on Expander Graphs.
SIAM J. Comput., 2020

Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs.
CoRR, 2020

Correlation decay for hard spheres via Markov chains.
CoRR, 2020

Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Counting independent sets in unbalanced bipartite graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Efficient sampling and counting algorithms for the Potts model on Z<sup>d</sup> at all temperatures.
CoRR, 2019

Algorithmic Pirogov-Sinai theory.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fast Algorithms at Low Temperatures via Markov Chains.
Proceedings of the Approximation, 2019

Extremes of the internal energy of the Potts model on cubic graphs.
Random Struct. Algorithms, 2018

Counting independent sets in cubic graphs of given girth.
J. Comb. Theory, Ser. B, 2018

On the Resilience of Bipartite Networks.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

Independent sets, matchings, and occupancy fractions.
J. Lond. Math. Soc., 2017

Tight bounds on the coefficients of partition functions via stability.
Electron. Notes Discret. Math., 2017

Limits of discrete distributions and Gibbs measures on random graphs.
Eur. J. Comb., 2017

The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph.
Eur. J. Comb., 2017

On the Widom-Rowlinson Occupancy Fraction in Regular Graphs.
Comb. Probab. Comput., 2017

Information-theoretic thresholds from the cavity method.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Spectral thresholds in the bipartite stochastic block model.
Proceedings of the 29th Conference on Learning Theory, 2016

Belief Propagation on Replica Symmetric Random Factor Graph Models.
Proceedings of the Approximation, 2016

Random <i>k</i>-SAT and the power of two choices.
Random Struct. Algorithms, 2015

Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

On the Complexity of Random Satisfiability Problems with Planted Solutions.
Electron. Colloquium Comput. Complex., 2014

Subsampled Power Iteration: a New Algorithm for Block Models and Planted CSP's.
CoRR, 2014

On Sharp Thresholds in Random Geometric Graphs.
Proceedings of the Approximation, 2014

The forgetfulness of balls and bins.
Random Struct. Algorithms, 2013

The Bohman-Frieze process near criticality.
Random Struct. Algorithms, 2013

On the Resilience of Bipartite Networks.
CoRR, 2013

Thresholds for Random Geometric k-SAT.
CoRR, 2013

Random k-SAT and the Power of Two Choices
CoRR, 2012

Hardness of Finding Independent Sets in Almost 3-Colorable Graphs.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010