Welcome!
I’m Dr. Phil Chodrow, an assistant professor in the Department of Computer Science at Middlebury College. My pronouns are he/him/his. You can email me at pchodrow@middlebury.edu or stop by my office, Room 218 in 75 Shannon Street.
My research sits at the intersection of applied mathematics, data science, and network science, the study of connected systems in society and nature. Recent topics include models of random hypergraphs, community detection in hypergraphs, opinion dynamics on networks, and gender representation in academic mathematics. My work is supported by the National Science Foundation.
I teach courses in math, data science, computation, and network science. I have written freely-available lecture notes for undergraduate courses on machine learning and (with Heather Zinn Brooks) network science. I have a CV. Middlebury students might want to take a look at my FAQs about classes and student research. I have thoughts about jobs at liberal arts colleges and help maintain a listingof CS jobs at primarily-undergraduate institutions.
When I’m not working, I’m probably drinking tea, practicing aikido, cycling, cooking, playing chess, running, reading, or playing board games.
News
| December 2025 |
I am invited mentor at the Complex Networks Winter Workshop (CNWW) in Quebec City, Canada. |
| November 2025 |
Invited talk on gender representation in academic mathematics at the UVM Complex Systems Institute. |
| October 2025 |
An Adhikari (Middlebury '25) wrote an app called lyncx which incorporates some cool network science ideas. An calls CSCI 0442 at Midd "the class that started it all" in the blog post documenting his development journey. |
| September 2025 |
In Fall '25 I am teaching CSCI 0200: Math Foundations of Computing and CSCI 0702: Senior Thesis. |
| August 2025 |
"Edge correlations and link prediction in growing hypergraphs" has been published in Physical Review E. Huge thanks to collaborators Xie He and Peter Mucha! |
| July 2025 |
Heather Brooks, Nicholas Landry, and I coorganize a minisymposium on mathematical methods in network science at the joint SIAM/CAIMS Annual Meeting in Montreal, Canada. |
| "Equivalence of Informations Characterizes Bregman Divergences" is published in Entropy. |