92 citations · 395 across the 40 of their papers we have counts for
5 papers · 1 filter
Limits of discrete distributions and Gibbs measures on random graphs
Amin Coja-Oghlan, Will Perkins, Kathrin Skubch
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we constru…
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs
Emma Cohen, Will Perkins, Prasad Tetali
We consider the Widom-Rowlinson model of two types of interacting particles on d-regular graphs. We prove a tight upper bound on the occupancy fraction, the expected fraction of ve…
Independent Sets, Matchings, and Occupancy Fractions
Ewan Davies, Matthew Jenssen, Will Perkins +1
We prove tight upper bounds on the logarithmic derivative of the independence and matching polynomials of d-regular graphs. For independent sets, this theorem is a strengthening of…
Spectral Thresholds in the Bipartite Stochastic Block Model
Laura Florescu, Will Perkins
We consider a bipartite stochastic block model on vertex sets and , with planted partitions in each, and ask at what densities efficient algorithms can recover the parti…
Birthday Inequalities, Repulsion, and Hard Spheres
Will Perkins
We study a birthday inequality in random geometric graphs: the probability of the empty graph is upper bounded by the product of the probabilities that each edge is absent. We show…