works on
central limit theorem 1efron-stein inequality 1giant component 1k-core 1random graphs 1

From the 1 of 2 linked papers with an AI index.

collaborators

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

Smoothed analysis for graph isomorphism

Michael Anastos, Matthew Kwan, Benjamin Moore

There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosop…