activity
20112025
most citedA central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference

35 citations · 56 across the 6 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2011★ 19 cited

Fast Approximate Quadratic Programming for Large (Brain) Graph Matching

Joshua T. Vogelstein, John M. Conroy, Vince Lyzinski +6

Quadratic assignment problems (QAPs) arise in a wide variety of domains, ranging from operations research to graph theory to computer vision to neuroscience. In the age of big data…