Andrew Beveridge is a Professor in the Department of Mathematics, Statistics and Computer Science at Macalester College, a liberal arts school in St Paul, Minnesota. He earned his BA in Mathematics at Williams College and his PhD in Mathematics at Yale University, under the supervision of Laszlo Lovasz. Andrew completed a post-doc at Carnegie Mellon University, spent some time working in the software industry, and was one of the inaugural Director’s Mathematicians-in-Residence at BSM in 2016.
Andrew studies combinatorics and graph theory, along with their applications to computer science. His interests include random walks, random graphs, pursuit-evasion games, combinatorial games, social choice theory, enumerative combinatorics and network science. His research has been supported by a grant from the National Security Agency, and he was the co-PI and co-Director of an applied mathematics summer REU, run jointly with the Institute for Mathematics and its Applications. He was awarded the MAA’s Allendoerfer Award for Expository Excellence, and the Janet Anderson Award by the Midstates Consortium for Mathematics and Science.
