◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Will Perkins

53 papers hereh-index 231.5k citations67 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author3
  • first author2
  • middle author24
  • last author23

Across the 52 of 53 papers where every author was matched, so the position is known.

fields
  • math.PR20
  • math.CO14
  • cs.DS12
  • cs.CC2
  • cond-mat.dis-nn1
  • cond-mat.stat-mech1
same name
  • Will Perkins — 8 papers, h 2
  • Will Perkins — 5 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedInformation-theoretic thresholds from the cavity method

92 citations · 395 across the 40 of their papers we have counts for

collaborators
Showing 2022Show all

4 papers · 1 filter

math.CO2022★ 1 cited

On the zeroes of hypergraph independence polynomials

David Galvin, Gwen McKinley, Will Perkins +2

We study the locations of complex zeroes of independence polynomials of bounded degree hypergraphs. For graphs, this is a long-studied subject with applications to statistical phys…

cs.CC2022

Algorithms and Barriers in the Symmetric Binary Perceptron Model

David Gamarnik, Eren C. Kızıldağ, Will Perkins +1

The symmetric binary perceptron (SBP) exhibits a dramatic statistical-to-computational gap: the densities at which known efficient algorithms find solutions are far belo…

math.PR2022★ 5 cited

Strong spatial mixing for repulsive point processes

Marcus Michelen, Will Perkins

We prove that a Gibbs point process interacting via a finite-range, repulsive potential ϕ exhibits a strong spatial mixing property for activities λ<e/Δϕ​, where Δϕ​ is the…

cs.DS2022

Fast and perfect sampling of subgraphs and polymer systems

Antonio Blanca, Sarah Cannon, Will Perkins

We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolati…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.