118 citations · 252 across the 14 of their papers we have counts for
Showing 2011Show all
2 papers · 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…
stat.ML2011
A consistent adjacency spectral embedding for stochastic blockmodel graphs
Daniel L. Sussman, Minh Tang, Donniell E. Fishkind +1
We present a method to estimate block membership of nodes in a random graph generated by a stochastic blockmodel. We use an embedding procedure motivated by the random dot product…