Professor Beveridge is a theoretical mathematician whose research interests lie in
the intersection of discrete mathematics and probability. His current area of research
includes graph theory, probability and random processes. He studies random walks on
finite graphs, which model connections that might be found in computer networks, the
world wide web, genetics, and include the logical connections in the economics of game
theory. 

Prior to coming to Macalester, Beveridge was at the Department of Mathematical Science at
Carnegie Mellon University and at the Institute for Mathematics and its Applications at
the University of Minnesota. Following graduate school, he also worked for several years
as a database architect for the Stanford University School of Medicine. 

EDUCATION: B.A., Williams College Ph.D., Yale University 

Articles

Link

Maker-Breaker games on random geometric graphs (with A. Dudek, A. Frieze, T. Muller, and M. Stojacovik), Random Structures and Algorithms (2014)
 

Link

On the minimal order of k-cop-win graphs (with W. Baird, A. Bonato, P. Codenotti, J. MacCauley, A. Maurer, and S. Valeva), Contributions to Discrete Mathematics (2014)
 

OpenURL

The Sorting Hat Goes to College (with S. Wagon), Mathematics Magazine (2014)
 

OpenURL

Symmetric rendezvous search on the line with an unknown initial distance (with V. Isler and D. Ozsoyeller), IEEE Transactions on Robotics (2013)
 

OpenURL

Visibility Number of Directed Graphs (with M. Axenovich, J. P. Hutchinson, and D. West), SIAM Journal on Discrete Mathematics (2013)