CV

Education

• PhD in Mathematics, Yale University, 1997
  • Advisor: László Lovász
  • Dissertation: Stopping Rules and Time Reversal for Finite Markov Chains
• MS in Mathematics, Yale University, 1997
• BA in Mathematics, Williams College, 1991
  • Magna Cum Laude, Phi Beta Kappa, Sigma Xi

Academic Appointments

• Macalester College (St Paul, MN, USA)
  • Professor 2018-present
  • Associate Professor 2013-2018
  • Assistant Professor 2007-2013
• Budapest Semesters in Mathematics (Budapest, Hungary)
  • Director’s Mathematician in Residence, Summer 2016
• Institute for Mathematics and its Applications (University of Minnesota, Minneapolis, MN, USA)
  • Long-Term Visitor 2014-2015
    • Thematic Year: Discrete Structures and their Applications
  • General Member 2011-2012
    • Thematic Year: Mathematics of Information
• Carnegie Mellon University (Pittsburgh, PA, USA)
  • Eugene P. Shelly Visiting Assistant Professor, 2005-2007
  • Richard J. Duffin Visiting Assistant Professor, 1997-1998

Non-Academic Appointments

• Stanford University School of Medicine (Stanford, CA)
  • Database Architect, Information Resources and Technology 2005
• NorthStar Software (San Francisco, CA, USA)
  • Senior Software Engineer, 2002-2005
• Extricity Software (Redwood Shores, CA, USA)
  • Sofware Engineer 1998-2002

Honors and Recognition

• Trustee’s Award, Macalester College, 2017
• Jim Hoppe Advisor of the Year Award, Macalester College, 2017
• Mathematical Moments: Dis-playing the Game of Thrones, American Mathematical Society, 2016
• Janet L. Andersen Lecture Award, Midstates Consortium for Math and Science, 2016
• Carl B. Allendoerfer Award for Expository Excellence, Mathematical Association of America, 2015

Publications

Random Walks and the Regeneration Time

A. Beveridge and L. Lovász, Random Walks and the Regeneration Time, Journal of Graph Theory 29 (1998), 57-62.

Random Minimum Length Spanning Trees in Regular Graphs

A. Beveridge, A. Frieze and C. McDiarmid, Random Minimum Length Spanning Trees in Regular Graphs, Combinatorica 18 (1998), 311-333.

Product Rule Wins a Competitive Game

A. Beveridge, T. Bohman, A. Frieze and O. Pikhurko, Product Rule Wins a Competitive Game, Proceedings of the American Mathematical Society, Vol. 135, No. 10 (2007), 3061-3072.

On the Connectivity of Extremal Ramsey Graphs

A. Beveridge and O. Pikhurko, On the connectivity of extremal Ramsey graphs, Australasian Journal of Combinatorics, 41 (2008), 57–62.

Game Chromatic Index of Graphs with Given Restrictions on Degrees

A. Beveridge, T. Bohman, A. Frieze and O. Pikhurko, Game Chromatic Index of Graphs with Given Restrictions on Degrees, Theoretical Computer Science, 407 (2008), 242–249.

Centers for Random Walks on Trees

A. Beveridge, Centers for random walks on trees, SIAM Journal on Discrete Mathematics, Vol. 23, Issue 1 (2009), pp. 300–319.

Memoryless Rules for Achlioptas Processes

A. Beveridge, T. Bohman, A. Frieze and O. Pikhurko, Memoryless rules for Achlioptas processes, SIAM Journal on Discrete Mathematics, Vol. 23, Issue 2 (2009), pp. 993–1005.

Exit Frequency Matrices for Finite Markov Chains

A. Beveridge and L. Lovász, Exit frequency matrices for finite Markov chains, Combinatorics, Probability and Computing 19 (2010), pp. 541–560.

Connectivity of Random Cubic Sum Graphs

A. Beveridge, Connectivity of Random Cubic Sum Graphs, SIAM Journal on Discrete Mathematics, Vol. 24, Issue 3 (2010), 895-909.

On the Mixing Time of Geographical Threshold Graphs

A. Beveridge and M. Bradonjić, On the Mixing Time of Geographical Threshold Graphs, Discrete Mathematics, Vol. 311, No. 23-24 (2011), p. 2637-2649.

The Mathematical Sorting Hat

A. Beveridge and S. Cooke, The Mathematical Sorting Hat, UMAP journal, Vol. 33, No. 2 (2012), pp. 99-118.

Cops and Robbers on Geometric Graphs

A. Beveridge, A. Dudek, A. Frieze, T. Müller, Cops and Robbers on Geometric Graphs, Combinatorics, Probability and Computing, Vol. 21, No. 6, (2012), pp. 816-834.

Exact Mixing Times for Random Walks on Trees

A. Beveridge and M. Wang, Exact Mixing Times for Random Walks on Trees, Graphs and Combinatorics, Vol. 29, No. 4, (2013), pp. 757-772.

Visibility Number of Directed Graphs

M. Axenovich, A. Beveridge, J. P. Hutchinson and D. West, Visibility Number of Directed Graphs, SIAM Journal on Discrete Mathematics, Vol 27, No. 3, (2013), 1429-1449.

Symmetric Rendezvous Search on the Line With an Unknown Initial Distance

D. Ozsoyeller, A. Beveridge and V. Isler, Symmetric Rendezvous Search on the Line With an Unknown Initial Distance, IEEE Transactions on Robotics, vol. 29, no. 6 (2013), pp. 1366-1379.

On the Minimal Order of $k$-Cop-Win Graphs

W. Baird, A. Beveridge, A. Bonato, P. Codenotti, J. MacCauley, A. Maurer, S. Valeva, On the Minimal Order of $k$-Cop-Win Graphs, Contributions to Discrete Mathematics, Vol 9, No. 1 (2014), pp. 1-15.

Maker-Breaker Games on Random Geometric Graphs

A. Beveridge, A. Dudek, A. Frieze, T. Mu ̈ller, M. Stojaković, Maker-Breaker Games on Random Geometric Graphs, Random Structures and Algorithms, Vol 45, No. 4 (2014), pp. 553-607.

The Sorting Hat Goes to College

A. Beveridge, S. Wagon, The Sorting Hat Goes to College, Mathematics Magazine, Vol 87, No. 4 (2014) pp. 243–251.

A Leapfrog Strategy for Pursuit-Evasion in Polygonal Environments

B. Ames, A. Beveridge, C. Djang, R. Carlson, V. Isler, S. Ragain, M. Savage, A Leapfrog Strategy for Pursuit-Evasion in Polygonal Environments, International Journal on Computational Geometry and Applications, Vol. 25, No. 2, (2015) pp. 77-100.

Pursuit-Evasion: A Toolkit to Make Applications More Accessible

A. Beveridge, V. Isler, N. Noori, Pursuit-Evasion: A Toolkit to Make Applications More Accessible, Robotics and Automation Magazine, Vol. 23, No. 4 (2016), pp. 138-149.

Network of Thrones

A. Beveridge, J. Shan, Network of Thrones, Math Horizons Magazine, Vol. 23, No. 4 (2016) pp. 18-22.

The Best Mixing Time for Random Walks on Trees

A. Beveridge, J. Youngblood, The Best Mixing Time for Random Walks on Trees, Graphs and Combinatorics, Vol. 32, No. 6 (2016) pp. 2211-2239.

A Hitting Time Formula for the Discrete Green's Function

A. Beveridge, A Hitting Time Formula for the Discrete Green's Function, Combinatorics, Probability and Computing, Vol. 25, (2016) pp. 362-379.

A Science of Networks

A. Beveridge, A Science of Networks, The Skeptic Magazine, Vol. 6, No. 2 (2016), pp. 18-21.

Pursuit-Evasion in a Two-Dimensional Domain

A. Beveridge, Y. Cai, Pursuit-Evasion in a Two-Dimensional Domain, Ars Mathematica Contemporanea, Vol. 13 (2017), 187-206.

The Game of "Game of Thrones": Fractal Dramaturgy and Networked Concordances

A. Beveridge and M. Chemers, The Game of "Game of Thrones": Fractal Dramaturgy and Networked Concordances, in: Narrative Ecosystems: Reading Contemporary Serial Television Universes (P. Brembilla and I. A. De Pascalis, Eds.), Rutledge Advances in Television Studies, 2018.

Rendezvous in Planar Environments with Obstacles and Unknown Initial Distance

D. Ozsoyeller, A. Beveridge and V. Isler Rendezvous in Planar Environments with Obstacles and Unknown Initial Distance, Artificial Intelligence Journal, Vol. 273 (2019), 19-36.

Line-of-Sight Pursuit in Monotone and Sweepable Polygons

L. Berry, A. Beveridge, J. Butterfield, V. Isler, Z. Keller, A. Shine, J. Wang, Line-of-Sight Pursuit in Monotone and Scallop Polygons, International Journal on Computational Geometry and Applications, Vol. 29, No. 4 (2019) 307–351.

The Voter Basis and the Admissibility of Tree Characters

A. Beveridge and I. Calaway, The Voter Basis and the Admissibility of Tree Characters, Order, Vol. 38, No. 1, (2021).

De Finetti Lattices and Magog Triangles

A. Beveridge, I. Calaway and K. Heysse, De Finetti Lattices and Magog Triangles, Electronic Journal of Combinatorics, Vol. 28, No. 1, (2021), P1.38.

The Exact Mixing Time for Trees with Fixed Diameter

A. Beveridge, K. Heysse, R. O'Higgins, L. Vescovo, https://arxiv.org/abs/2411.06247.

Random Walks and the Meeting Time for Trees

A. Beveridge, B. Bridenbaugh, A. Holcombe-Pomerance, Random Walks and the Meeting Time for Trees, https://arxiv.org/abs/2508.02804

Random Walks and the Best Meeting Time for Trees

A. Beveridge, A. Holcombe-Pomerance, Random Walks and the Best Meeting Time for Trees, https://arxiv.org/abs/2510.24387

Teaching

Macalester College

• Math 479 Network Science
  • S15, S17, S18, S19, F20
• Math 469 Combinatorial Optimization
  • F08
• Math 394 Topics in Graph Theory
  • F07
• Math 378 Complex Analysis
  • S18, S19, S20
• Math 379 Combinatorics
  • F09, F11, F13, F15, F16, F17, F18
• Math 376 Algebraic Structures
  • S08, S09, S10, S12, S13, S16
• Math 279 Discrete Mathematics
  • F16, S17, F18, F19, S20
• Math 236 Linear Algebra
  • F09, S12, F12, S14, F17, F19, F20
• Math 137 Single Variable Calculus
  • F08
• Math 136 Discrete Mathematics: How to Be a Player
  • F12
• Math 136 Discrete Mathematics
  • S09, F11, S13, F13, S14, F15
• Math 135 Applied Calculus
  • F07, S08, S10

Carnegie Mellon University

• Math 341 Linear Algebra
  • S98
• Math 320 Symbolic Programming Methods
  • S07
• Math 257 Models and Methods for Optimization
  • S06
• Math 241 Matrix Algebra
  • F06
• Math 228 Discrete Mathematics
  • S98
• Math 127 Concepts of Mathematics
  • F05, S07
• Math 126 Introduction to Mathematical Software
  • F05, S06
• Math 111 Calculus I
  • F97

Yale University

• Math 120 Calculus of Functions of Several Variables
  • S96, S97
• Math 115 Calculus of Functions of One Variable II
  • F94
• Math 112 Calculus of Functions of One Variable I
  • SU97

Service

• MAA Spectrum Editorial Board, 2016 - present
• Director, MAXIMA REU 2009-2014, in partnership with the Institute for Mathematics and its Applications
• Referee for two dozen journals
• Session organizer/chair at various conferences
• Math Area Coordinator, MSCS Department, 2018-2020
• Various elected committees, Macalester College
• Konhauser Problemfest organizer, 2010 - present