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

Connectivity of Random Cubic Sum Graphs, SIAM Journal of Discrete Mathematics (2010)
 

Link

Exit frequency matrices for finite Markov chains (with László Lovász), Combinatorics, Probability and Computing (2010)
 

Link

Centers for random walks on trees, SIAM Journal of Discrete Mathematics (2009)
 

Link

Memoryless Rules for Achlioptas Processes (with Tom Bohman, Alan Frieze, and Oleg Pikhurko), SIAM Journal of Discrete Mathematics (2009)