Jennifer Chayes
Pioneer in Algorithmic Phase Transitions & Network Graph Limits
Jennifer Chayes
Pioneer in Algorithmic Phase Transitions & Network Graph Limits
Biographical Overview
Pioneered the mathematical theory of graphons and graph limits, explaining how phase transitions from statistical physics govern the computational hardness of network algorithms. As Dean of the College of Computing, Data Science, and Society at UC Berkeley and co-founder of Microsoft Research New England and NYC, Chayes proved why optimization problems suddenly become exponentially difficult at critical density thresholds.
"Networks are everywhere—from neural synapses and social connections to internet routing. Understanding their mathematical limits reveals how computation scales."
— Jennifer Chayes
Historical Context & Impact
Jennifer Chayes used principles from thermodynamics—like the abrupt moment liquid water snaps into solid ice—to prove how computer algorithms hit computational walls. She demonstrated that when graph connectivity crosses a precise mathematical threshold, finding optimal solutions shifts abruptly from instantaneous to computationally intractable.
