1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.PR2024★ 1 cited
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…
cs.DS2024
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…