PhD, Electrical and Systems Engineering, University of Pennsylvania, 2014

MS, Electrical and Systems Engineering, University of Pennsylvania, 2010

BE, Engineering Science (Control Theory), Dartmouth College, 2008

AB, Engineering Science (Social Systems), Dartmouth College, 2007


I am currently teaching ESE 605: Modern Convex Optimization. The syllabus for the course can be found here.


My research interests include Network Science, Convex Optimization and Analysis, Game Theory and Machine Learning. My PhD Thesis was on Fast Distributed Resource Allocation Strategies in Networks, in which I developed a family of distributed approximations of Newton's method for convex network flow problems including application to packet forwarding in wireless networks. During my PhD I was advised by Ali Jadbabaie and have continued to work closely with Alejandro Ribeiro.

Additionally, I study the problem of controlling epidemics and other harmful processes that spread through existing social or infrastructure networks with Victor Preciado . Using a novel transformation of viral spreading dynamics in networks, it is possible solve for optimal resource allocation strategies (including multiple classes of resources) using generalized geometric programs.

I have also worked on Network Science tools for generalized graphs (simplicial complexes). We rank edges in a simplicial complex based on a generalized Page Rank operator. Hodge Decomposition of the rankings tell us whether the edge is important due to holes, sparse cuts or cliques. Some results of these tools can be found here:
Dumbbell Demo
Small Proximity Network
Large Proximity Network
Collaboration Network
Collaboration Network Generated by Publication Date
The first four videos show variation over the parameter beta (encodes teleportation probability) and in the last the complex changes with time. The edge thicknesses indicate their "edge page rank" and the color indicates which Hodge subspace contributes primarily to its rank.