2 papers
math.CO2025
A short proof of a central limit theorem for the order of the giant component and -core
Michael Anastos, Joshua Erde, Mihyun Kang +1
In this note we outline a new and simple approach to proving central limit theorems for various 'global' graph parameters which have robust 'local' approximations, using the Efron-…
math.CO2025
The law of the circumference of sparse binomial random graphs
Michael Anastos, Joshua Erde, Mihyun Kang +1
There has been much interest in the distribution of the circumference, the length of the longest cycle, of a random graph in the sparse regime, when $p = Θ\left(\frac{1}{n…