This page contains .pdfs of my recent research talks and posters.
Beamer Slides | Conference | Date |
Computational Methods for Assessing Districting Plans | INFORMS Annual Meeting | 11/20 |
Graphs, Geometry, and Gerrymandering | St. Michael's College Pi Mu Epsilon Lecture | 10/20 |
Geospatial Data for Political Redistricting Analysis | ADSA Annual Meeting | 10/20 |
Graphs, Geometry, and Gerrymandering | TSU Math and Political Science Colloquium | 10/20 |
Representations of SL2(Z/p^nZ) and the Adjacency Structure of Bethe Trees | WSU Combinatorics, Linear Algebra, and Number Theory Seminar | 9/20 |
Multiresolution Redistricting | Duke Tripods Conference on Quantitative Redistricting | 3/20 |
Geospatial Data, Markov Chains, and Political Redistricting | College of Charleston Math Colloquium | 2/20 |
Geospatial Data, Markov Chains, and Political Redistricting | WSU Math Colloquium | 1/20 |
Markov Chain Sampling Connected Graph Partitions | JMM 2020 | 1/20 |
The Mathematics of Nested Legislative Districts | Pacific University Math Colloquium | 1/20 |
Connected Graph Partitions and Political Districts | MIT Computer Graphics Retreat | 10/19 |
Hardness results for sampling connected graph partitions with applications to redistricting | Ohio State University Topology, Geometry and Data Seminar | 9/19 |
Graphs, Geometry, and Gerrymandering | Denison University | 9/19 |
Graphs, Geometry, and Gerrymandering | College of Wooster | 9/19 |
Graphs, Geometry, and Gerrymandering | Oberlin College | 9/19 |
Graphs, Geometry, and Gerrymandering | Kenyon College Math Monday | 9/19 |
Hardness results for sampling connected graph partitions with applications to redistricting | University of Massachusetts Lowell Applied Math | 9/19 |
Mathematical Challenges in Neutral Redistricting | Yale Math Colloquium | 8/19 |
A friendly introduction to discrete MCMC | VRDI 2019 | 6/19 |
Graphs and Networks: Discrete Approaches to Redistricting | VRDI 2019 | 6/19 |
Total Variation Isoperimetric Profiles and Political Redistricting | Dartmouth Math Colloquium | 4/19 |
Hardness results for sampling connected graph partitions with applications to redistricting | Dartmouth ACMS | 4/19 |
Legal and Math Deep Dive: Gerrymandering and Redistricting | Unrig Summit | 3/19 |
Computational Problems in Neutral Redistricting | MIT Graphics Seminar | 3/19 |
Matched Products and Stirling Numbers of Graphs | JMM 2019 | 1/19 |
Computational Problems in Neutral Redistricting | SCADA'18 | 12/18 |
Matched Products and Stirling Numbers of Graphs | Tufts Math Colloquium | 11/18 |
Compactness Profiles and Reversible Sampling Methods for Plane and Graph Partitions | SAMSI Quantitative Redistricting | 10/18 |
Mathematical Modeling of Social Connections | Tufts STS | 9/18 |
Introduction to Monte Carlo Methods | Voting Rights Data Institute | 6/18 |
Matched Products and Dynamical Models for Multiplex Networks | Ph.D. Defense | 5/18 |
Dynamics on Multiplex Networks | University of Central Florida | 2/18 |
Random Walk Null Models for Time Series | Grand Valley State University | 2/18 |
Mathematical Embeddings of Complex Systems | Santa Fe Institute | 2/18 |
Dynamics on Multiplex Networks | University of San Fransisco | 1/18 |
Dynamics on Multiplex Networks | Providence College | 1/18 |
Dynamics Modeling for Multiplex Networks | JMM 2018 | 1/18 |
Distributions over Networks | Math Department Graduate Student Open House | 4/17 |
Permutation Complexity for Time Series | SIAM Annual Meeting | 7/17 |
Generalized Random Dot Product Models | ACMS Seminar | 10/16 |
More than ``just'' Networks | Math Department Graduate Open House | 4/16 |
Dynamically Motivated Models for Multiplex Networks | SFI Inference on Networks | 12/15 |
Multiplex Structure on the World Trade Web | Applied Math Days | 4/15 |
Total Dynamics on Multiplex Networks | Graduate Student Combinatorics Conference | 3/15 |
Total Dynamics on Multiplex Networks | Math Department Graduate Open House | 3/15 |
Enumerating Distinct Chessboard Tilings | 16th International Fibonacci Conference | 7/14 |
Empirical Analysis of Space-Filling Curves for Scientific Computing Applications | Dartmouth GSS | 1/14 |
Empirical Analysis of Space-Filling Curves for Scientific Computing Applications | ICPP '13 | 10/13 |
Counting Combinatorial Rearrangements: What are the right questions? | Dartmouth GSS | 8/13 |
Enumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part II | WSU Algebra Seminar | 2/13 |
Enumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I | WSU Algebra Seminar | 1/13 |
Counting Combinatorial Rearrangements, Tilings with Squares and Symmetric Tilings | JMM '13 | 1/13 |
Combinatorial Rearrangements on Arbitrary Graphs | YMC '12 | 7/12 |