Will Perkins

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers53 papers

Sort

By YearBy Citation

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

Tyler Helmuth, Matthew Jenssen,Will Perkins

Bibtex

On the Number of Independent Sets in Uniform, Regular, Linear Hypergraphs

Cohen Emma,Perkins Will, Sarantis Michail,Tetali Prasad

Bibtex

Correlation decay for hard spheres via Markov chains

Helmuth Tyler,Perkins Will, Petti Samantha

Cited by1Bibtex

A proof of the Upper Matching Conjecture for large graphs

Davies Ewan, Jenssen Matthew,Perkins Will

Bibtex

Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures

Christian Borgs,Jennifer Chayes, Tyler Helmuth,Will Perkins,Prasad Tetali

STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing Chicago IL ..., pp.738-751, (2020)

EIBibtex

Algorithms for #BIS-Hard Problems on Expander Graphs

Matthew Jenssen,Peter Keevash,Will Perkins

SIAM J. Comput., no. 4 (2020): 681-710

EIBibtex

Bethe States of Random Factor Graphs

Amin Coja-Oghlan,Will Perkins

Communications in Mathematical Physics, no. 1 (2019): 173-201

Bibtex

ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS

Matthew Jenssen,Felix Joos,Will Perkins

Forum of Mathematics, Sigma, (2019)

Bibtex

Algorithms for #BIS-hard problems on expander graphs

Matthew Jenssen,Peter Keevash,Will Perkins

SODA '19: Symposium on Discrete Algorithms San Diego California January, 2019, (2019): 2235-2247

Cited by21EIBibtex

Algorithmic Pirogov-Sinai theory

Tyler Helmuth,Will Perkins,Guus Regts

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, no. 3 (2019): 851-895

Cited by25EIBibtex

Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures

Borgs Christian,Chayes Jennifer, Helmuth Tyler,Perkins Will,Tetali Prasad

Bibtex

On the hard sphere model and sphere packings in high dimensions

Matthew Jenssen,Felix Joos,Will Perkins

FORUM OF MATHEMATICS SIGMA, (2019)

Cited by5Bibtex

Fast Algorithms at Low Temperatures via Markov Chains

Zongchen Chen,Andreas Galanis,Leslie Ann Goldberg,Will Perkins, James Stewart,Eric Vigoda

international workshop and international workshop on approximation randomization and combinatorial o..., pp.14, (2019)

Bibtex

Fast Algorithms at Low Temperatures via Markov Chains

Zongchen Chen,Andreas Galanis,Leslie Ann Goldberg,Will Perkins, James Stewart,Eric Vigoda

arXiv: Data Structures and Algorithms, (2019)

EIBibtex

Independent sets in the hypercube revisited

Jenssen Matthew,Perkins Will

Journal of The London Mathematical Society-second Series, no. 2 (2019): 645-669

Bibtex

Markov chains for the hard-core model via polymer models

Chen Zongchen,Galanis Andreas,Goldberg Leslie Ann,Perkins Will, Stewart James,Vigoda Eric

Bibtex

Spin Systems on Bethe Lattices

Amin Coja-Oghlan,Will Perkins

Communications in Mathematical Physics, no. 2 (2019): 441-523

Bibtex

Storage capacity in symmetric binary perceptrons

Benjamin Aubin,Will Perkins,Lenka Zdeborová

Journal of Physics A, no. 29 (2019): 294003

Cited by4Bibtex

Counting independent sets in cubic graphs of given girth

Guillem Perarnau,Will Perkins

Journal of Combinatorial Theory, Series B, (2018): 211-242

Cited by3EIBibtex

On kissing numbers and spherical codes in high dimensions

Matthew Jenssen,Felix Joos,Will Perkins

Advances in Mathematics, (2018): 307-321

Cited by4Bibtex

View All

Base Info Papers Patents Projects

Will PerkinsBinding

Papers53 papers

Will Perkins