From the 1 of 2 linked papers with an AI index.
2 papers
math.CO2026
A short proof of a central limit theorem for the order of the giant component and -core
Michael Anastos, Joshua Erde, Mihyun Kang +1
The paper introduces a simple approach based on the Efron–Stein inequality to prove central limit theorems for the size of the giant component and the k‑core in sparse random graph…
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}{…