690 citations · 3.2k across the 50 of their papers we have counts for
51 papers
Leveraging local network communities to predict academic performance
David Burstein, Franklin Kenter, Feng Shi
For more than 20 years, social network analysis of student collaboration networks has focused on a student's centrality to predict academic performance. And even though a growing a…
Asymptotics of the spectral radius for directed Chung-Lu random graphs with community structure
David Burstein
The spectral radius of the adjacency matrix can impact both algorithmic efficiency as well as the stability of solutions to an underlying dynamical process. Although much research…
The K Shortest Paths Problem with Application to Routing
David Burstein, Leigh Metcalf
Due to the computational complexity of finding almost shortest simple paths, we propose that identifying a larger collection of (nonbacktracking) paths is more efficient than findi…
Degree switching and partitioning for enumerating graphs to arbitrary orders of accuracy
David Burstein, Jonathan Rubin
We provide a novel method for constructing asymptotics (to arbitrary accuracy) for the number of directed graphs that realize a fixed bidegree sequence with maximu…
Sufficient Conditions for Graphicality of Bidegree Sequences
David Burstein, Jonathan Rubin
There are a variety of existing conditions for a degree sequence to be graphic. When a degree sequence satisfies any of these conditions, there exists a graph that realizes the seq…
Interception in Distance-Vector Routing Networks
David Burstein, Franklin Kenter, Jeremy Kun +1
Despite the large effort devoted to cybersecurity research over the last decades, cyber intrusions and attacks are still increasing. With respect to routing networks, route hijacki…