Presentations
 Public Lecture, 2018 CMS Winter Meeting. I also spoke on the session devoted to Robert Woodrow's 70th birthday.
 What we know and don't know about the cop number of a graph, McMaster University.
 The New World of Infinite Random Geometric Graphs, McMaster University.
 Grad Seminar, Ryerson University.
 Modeling and Mining Dynamic Competition Networks, SIAM Discrete Mathematics Meeting, Boulder, Colorado.
 New bounds on the localization number, CMS Summer Meeting, Fredericton.
 Graph searching and probabilistic methods, invited Mathematics Department colloquium at Iowa State University and University of South Carolina.
 The New World of Infinite Random Geometric Graphs, Mathematics & Statistics Colloquium, Dalhousie University, Halifax.
 Connecting the dots: communicating mathematics in the 21st century, CMN600  Science, Communication & Society course at Ryerson University.
 Enemies of enemies are friends: the ILAT model for social networks, JMM'18, San Diego.

Graph searching and probabilistic methods, Computer Science seminar, Purdue University.
2017
 The New World of Infinite Random Geometric Graphs,CRMISM Colloquium, Universite Laval.
 Graph searching and probabilistic methods, PIMSUManitoba Distinguished Lecture.
 Burning spiders and path forests, Combinatorics Series seminar, University of Manitoba.
 Burning spiders and path forests, Discrete Math seminar, University of Rhode Island.
 Modelling, mining, and searching networks, Applied Mathematics graduate seminar, Ryerson University.
 Topological directions in Cops and Robbers, 6th Graph Searching in Canada (GRASCan'17), Grenfell Campus, Memorial University.
 The geometry of social networks, Workshop on Random Geometric Graphs and Their Applications to Complex Networks, The Fields Institute.
 Games and Graphs: the Legacy of RJN, 6th Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM'17), Ryerson University.
 Some topological questions/conjectures on Cops and Robbers, Open Problem session, 8th workshop on GRAph Searching, Theory & Applications (GRASTA), Anogia, Crete.
 Graph Searching Games and Probabilistic Methods, keynote lecture in 8th workshop on GRAph Searching, Theory & Applications (GRASTA), Anogia, Crete.
 Overprescribed Cops and Robbers, Graphs at Ryerson seminar.
2016
 Isomorphism results for infinite random geometric graphs , Random Geometric Graphs and Their Applications to Complex Networks, BIRS, Alberta.
 Modelling, mining, and searching networks, Applied Mathematics graduate seminar, Ryerson University.
 The geometry of social networks, keynote lecture in 1st Symposium on Spatial Networks, Oxford University, UK.
 Mining and modelling character networks, Complex Networks Seminar, Queen Mary, University of London, UK.
 Overprescribed Cops and Robbers, Graph Searching in Canada (GRASCan'16), Dalhousie University, Halifax.
 The New World of Infinite Random Geometric Graphs, plenary lecture, East Coast Combinatorics Conference (ECCC), Mount Saint Vincent University, Halifax.
 Conjectures on Cops and Robbers Games on Graphs, University of Iceland, Mathematics Seminar.
 The game of Zombies and Survivors played on graphs, SIAM DM'16, Atlanta.
 Conjectures on Cops and Robbers 2.0, Graphs at Ryerson Seminar, Ryerson University, and at University of Ottawa.
2015
 Dimension matching in Facebook and LinkedIn networks, ICMCE'15, V.I.T. University, Chennai, India. and ICC3, PSG College of Technology, Coimbatore, India.
 Cops and Robbers played on graphs, Stella Maris College, Chennai, India.
 Graduate Seminar, Fall 2015.
 A probabilistic version of the game of Zombies and Survivors played on graphs, 7th Graph Searching, Theory and Applications (GRASTA), Montreal.
 The game of Zombies and Survivors played on graphs, CMS Summer Meeting, Session on Graphs, Designs and Hypergraphs.
 How to burn a graph, 3rd Canadian Graph Searching (GRASCan'15) workshop.
 Don't be dense, try hypergraphs!, Graphs@Ryerson seminar.
 Independence densities of hypergraphs, York University Discrete Mathematics Seminar.
2014
 Burning a graph as a model of social contagion, 11th Workshop on Algorithms and Models for the Web Graph, Beijing.
 Burning a graph as a model of social contagion, Chinese Academy of Sciences, Beijing.
 Dimension matching in Facebook and LinkedIn networks, University of Toronto, Seminar on Social Networks, Big Data, Influence, and DecisionMaking.
 The Robber strikes back, SIAM Discrete Mathematics meeting, Minneapolis.
 Independence densities of hypergraphs, CMS Summer meeting, Winnipeg.
 Dimension matching in Facebook and LinkedIn networks, University of Delaware, Discrete Mathematics Seminar.
 Conjectures on Cops and Robbers, 2014 Joint Mathematics Meeting, AMS Special Session
on My Favorite Graph Theory Conjectures, Baltimore.
2013
 Six dimensions of separation in social networks, Computational Intelligence, Cyber Security & Computational Models (ICC3), Coimbatore, India.
 Master's Seminar, 2013
 Six dimensions of separation in social networks, Science Atlantic 36th Mathematics, Statistics, & Computer Science Conference, Charlottetown.
 The logarithmic dimension hypothesis, 17th INFORMS APS Meeting, Costa Rica.
 The length of vertex pursuit games,
18th Coast Combinatorics Conference, KailuaKona, Hawaii.
2012
 Master's Seminar, 2012
 Cops and Robbers: Directions and Generalizations 5th Workshop on GRAph Searching, Theory and Applications, BIRS, Banff, October 2012. Watch the presentation.
 The Logarithmic Dimension Hypothesis MITACS International Problem Solving Workshop, Vancouver, July 2012.
 Seepage in directed acyclic graphs,
SIAMDM'12, Halifax, June 2012.
Some presentations from the invited minisymposium "Cops and Robber Games on Graphs":
Andrew Beveridge, Cops and Robbers on Geometric Graphs
Shannon Fitzpatrick, Cops and Scared Robber
Pawel Pralat, Chasing Cops on Random Graphs  What is left to do on Cops and Robbers? GRASCan'12, Toronto, May 2012.
 Vertex pursuit in hierarchical social networks, TAMC'12, Beijing, China, May 2012.
2018
2011
 The game of Cops and Robbers on graphs, ICMCM'11, Coimbatore, India, December 1921.
 Seepage as a model for counterterrorism, CMS Winter meeting, Toronto, December 12.
 Complex Networks and their Models, Mathematics Graduate Seminar, Ryerson University, October 13.
 Random copwin graphs, Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM) 2011, University of Victoria, May 31.
 Almost all copwin graphs contain a universal vertex, 15th International Conference on Random Structures and Algorithms (RSA'11), Emory University, May 27.
2010
 The geometric protean model for online social networks, 7th Workshop on Algorithms and Models for the Web Graph (WAW 2010), Stanford University, December 16.
 Graduate Seminar, Ryerson, October 21.
 A short course on complex networks,