Skip to the content.
Undergraduate Research | Welcome

General Areas of Interest

I’m typically interested in research projects in the following categories. If you’ve got an idea that falls into (or nearby) one of these areas and you’d like to work together, send me an e-mail.

Case Studies and the Social Good

I’ve authored several of the Undergraduate Research Case Studies for SNHU over the past three years. If you’ve looked at these case studies, you’ll notice that the majority of them offer researchers an opportunity to think about, and advocate for, making positive change around an important issue within their local, state, or larger communities.

Data Science and Machine Learning

Using data and writing code to help computers learn to solve, or provide insight into, non-trivial problems is truly empowering. I’ve mentored students using both R and Python to build models for either predictive or descriptive purposes in a variety of applications. Check out the UCI Machine Learning Repository and Kaggle for interesting project ideas. Additionally, I encourage anyone interested in Data Science to follow the TidyTuesday social data visualization project and to participate using our SNHU Analytics Slack Channel (e-mail me for an invite) or using the hashtag #TidyTuesday on Twitter.

A sample of recent student projects in data science include:

Simulation and Agent-Based Modeling

Need to write…

Mathematical Modeling

Need to write…

Graph Theory

I spent much of my time in graduate school working in this area of discrete mathematics. Formally, a graph consists of two sets – the first, a vertex-set, is a list of nodes (dots) in the graph, while the second, an edge-set, is a set containing pairs of vertices (lines connecting two dots) which indicate connections between nodes. There are many interesting properties of these graph structures that can be examined, including planarity, connectivity, subgraph properties, and more. My research was largely focused on graph colorings and graph representations. In general, graph colorings are mappings from a finite set of k “colors”, to the vertices of a graph – we can set rules for which tupes of colorings are permissible and disocover properties that a graph must possess in order for a permissible k-coloring to exist. Graph representations are schemes for encoding graph structure – some common examples include the adjacency matrix and edge-list, however we can consider more abstract representations such as using subtrees of a particular class of tree to represent each vertex and defining edges to exist between a pair of vertices when the trees representing the pair satisfy some property. It can be quite interesting to explore the limitations of such representation schemes.

Combinatorial Games

Need to write…



Back to Homepage