1 citations · 1 across the 3 of their papers we have counts for
4 papers
The replica symmetric solution for hypergraph independent sets in the critical regime
Matthew Jenssen, Will Perkins, Aditya Potukuchi +1
We prove a variational formula for the logarithmic asymptotics of a non-existence probability in a broad class of combinatorial problems such as avoiding cliques in random graphs a…
Lower tails for triangles inside the critical window
Matthew Jenssen, Will Perkins, Aditya Potukuchi +1
We study the probability that the random graph is triangle-free. When or the asymptotics of the logarithm of this probability are known…
Sampling and counting triangle-free graphs near the critical density
Matthew Jenssen, Will Perkins, Aditya Potukuchi +1
We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erdős-Rényi random graph conditioned on triangle-freeness? Can we e…
On the evolution of structure in triangle-free graphs
Matthew Jenssen, Will Perkins, Aditya Potukuchi
We study the typical structure and the number of triangle-free graphs with vertices and edges where is large enough so that a typical triangle-free graph has a cut cont…