516 citations · 517 across the 5 of their papers we have counts for
6 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…
On fractional triangle decompositions of random graphs
Ghaura Mahabaduge, Michael Simkin
We prove that with high probability with admits a fractional triangle decomposition (FTD), i.e., a nonnegative weighting of its triangles such th…
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…
Ramsey and Turán numbers of sparse hypergraphs
Jacob Fox, Maya Sankar, Michael Simkin +2
Degeneracy plays an important role in understanding Turán- and Ramsey-type properties of graphs. Unfortunately, the usual hypergraphical generalization of degeneracy fails to captu…
Minimum Thermal Conductivity of Superlattices
M. V. Simkin, G. D. Mahan
The phonon thermal conductivity of a multilayer is calculated for transport perpendicular to the layers. There is a cross over between particle transport for thick layers to wave t…