 CV
 Github profile
 Google Scholar profile
 Contact me at kyledotklosteratgmail
Since June of 2016 I have been a Moore Data Fellow postdcotoral researcher in Professor Blair Sullivan's Theory in Practice lab, in the Computer Science Department of NCSU. We develop theory and algorithms for graph analysis aimed at identifying structures common to realworld data such that we can help pracitioners solve problems that would otherwise be computationally infeasible.
I spent six years at Purdue as a Math PhD student working with Prof. David F. Gleich who's in Purdue's CS department. Broadly, my research there was in graph theory, linear algebra, and scientific computing, usually motivated by applications in network analysis.
Research
Peerreviewed publications
 A practical fpt algorithm for Flow Decomposition and transcript assembly.
 Joint work with P. Kuinke, M.P. O'Brien, F. Reidl, F. Sanchez Villaamil, B.D. Sullivan, and A. van der Poel, accepted to ALENEX (2017).
 Code available here.
 Localization in Seeded PageRank.
 Joint work with Huda Nassar and David F. Gleich, Internet Mathematics (2017).

AptRank: An Adaptive PageRank Model for Protein Function Prediction.
 Joint with Biaobin Jiang, David F. Gleich, and Michael Gribskov, Bioinformatics (2017).
 Code available here.

Seeded PageRank Solution Paths
 Joint work with David F. Gleich, European Journal of Applied Mathematics, special issue on Mesoscale Network Structure (2016).

Scaling graph clustering algorithms
 Joint work with Merrielle Spain and Stephen Kelley, KDD Workshop on Mining and Learning with Graphs, KDD MLG proceedings (2016).

Strong Localization in Personalized PageRank
 Joint work with Huda Nassar and David F. Gleich, WAW2015 proceedings (2015).
 Sublinear Columnwise Actions of the Matrix Exponential on Social Networks
 Joint work with David F. Gleich, Internet Mathematics (2014).
 Heat kernel based community detection
 Joint work with David F. Gleich, SIGKDD 2014 proceedings (2014).
 A NearlySublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks
 Joint work with David F. Gleich, WAW2013 proceedings (2013).
Technical reports and work in progress
 Walk regularity and walkentropy.
 Joint work with Dan Kra'l and Blair D. Sullivan (Submitted.)
 Scalable and Robust Local Community Detection via Adaptive Subgraph Extraction and Diffusions.
 Joint with Yixuan Li. (Submitted.)
 Code vailable here.
 Condition Number of Krylov Matrices and Subspaces via Kronecker Product Structure.
 Joint with David Imberti.
Presentations and conferences
 ILAS 2017  July, Iowa State University  David Imberti and I presented our work on the conditioning of Krylov matrices in the minisymposium on Solving Matrix Equations.
Work Experience
 NCSU Computer Science  Theory in Practice research group run by Professor Blair Sullivan.
 Moore Data Fellow postdoctoral researcher, beginning June 2016.
 MIT Lincoln Labs  Cyber Analytics and Decision Systems group. Intern, summer 2015.
 My project was developing theory and code to scale graph algorithms for community detection.
 Research assistant, Purdue University.
 Six semesters at Purdue I was a research assistant for David F. Gleich, working on network analysis projects.
 Instructor, Purdue University.
 I have 8 semesters of teaching experience, ranging from freshman algebra and calculus to graduate numerical linear algebra. For more information, see here.