| Statistical inference on random dot product graphs: a survey A Athreya, DE Fishkind, M Tang, CE Priebe, Y Park, JT Vogelstein, ... Journal of Machine Learning Research 18 (226), 1-92, 2018 | 303 | 2018 |
| Fast approximate quadratic programming for graph matching JT Vogelstein, JM Conroy, V Lyzinski, LJ Podrazik, SG Kratzer, ET Harley, ... PLOS one 10 (4), e0121002, 2015 | 211 | 2015 |
| Graph matching: Relax at your own risk V Lyzinski, DE Fishkind, M Fiori, JT Vogelstein, CE Priebe, G Sapiro IEEE transactions on pattern analysis and machine intelligence 38 (1), 60-73, 2015 | 190 | 2015 |
| Community detection and classification in hierarchical stochastic blockmodels V Lyzinski, M Tang, A Athreya, Y Park, CE Priebe IEEE Transactions on Network Science and Engineering 4 (1), 13-26, 2016 | 177 | 2016 |
| A semiparametric two-sample hypothesis testing problem for random graphs M Tang, A Athreya, DL Sussman, V Lyzinski, Y Park, CE Priebe Journal of Computational and Graphical Statistics 26 (2), 344-354, 2017 | 153 | 2017 |
| Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding V Lyzinski, DL Sussman, M Tang, A Athreya, CE Priebe Electronic Journal of Statistics 8 (2), 2905-2922, 2014 | 151 | 2014 |
| A limit theorem for scaled eigenvectors of random dot product graphs A Athreya, CE Priebe, M Tang, V Lyzinski, DJ Marchette, DL Sussman Sankhya A 78, 1-18, 2016 | 144 | 2016 |
| A nonparametric two-sample hypothesis testing problem for random graphs M Tang, A Athreya, DL Sussman, V Lyzinski, CE Priebe Bernoulli 23 (3), 1599-1630, 2017 | 123* | 2017 |
| Seeded graph matching for correlated Erdös-Rényi graphs. V Lyzinski, DE Fishkind, CE Priebe J. Mach. Learn. Res. 15 (1), 3513-3540, 2014 | 109 | 2014 |
| Seeded graph matching DE Fishkind, S Adali, HG Patsolic, L Meng, D Singh, V Lyzinski, ... Pattern recognition 87, 203-215, 2019 | 99* | 2019 |
| On a two-truths phenomenon in spectral graph clustering CE Priebe, Y Park, JT Vogelstein, JM Conroy, V Lyzinski, M Tang, ... Proceedings of the National Academy of Sciences 116 (13), 5995-6000, 2019 | 97 | 2019 |
| A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference K Levin, A Athreya, M Tang, V Lyzinski, Y Park, CE Priebe arXiv preprint arXiv:1705.09355, 2017 | 65* | 2017 |
| Spectral clustering for divide-and-conquer graph matching V Lyzinski, DL Sussman, DE Fishkind, H Pao, L Chen, JT Vogelstein, ... Parallel Computing 47, 70-87, 2015 | 61 | 2015 |
| A central limit theorem for an omnibus embedding of multiple random dot product graphs K Levin, A Athreya, M Tang, V Lyzinski, CE Priebe 2017 IEEE international conference on data mining workshops (ICDMW), 964-967, 2017 | 48 | 2017 |
| Vertex nomination schemes for membership prediction DE Fishkind, V Lyzinski, H Pao, L Chen, CE Priebe Annals of Applied Statistics 9 (3), 1510-1532, 2015 | 40 | 2015 |
| Matched filters for noisy induced subgraph detection DL Sussman, Y Park, CE Priebe, V Lyzinski IEEE transactions on pattern analysis and machine intelligence 42 (11), 2887 …, 2020 | 39 | 2020 |
| A joint graph inference case study: the C. elegans chemical and electrical connectomes L Chen, JT Vogelstein, V Lyzinski, CE Priebe Worm 5 (2), e1142041, 2016 | 35 | 2016 |
| Information recovery in shuffled graphs via graph matching V Lyzinski IEEE Transactions on Information Theory 64 (5), 3254-3273, 2018 | 34 | 2018 |
| Semi-external memory sparse matrix multiplication for billion-node graphs D Zheng, D Mhembere, V Lyzinski, JT Vogelstein, CE Priebe, R Burns IEEE Transactions on Parallel and Distributed Systems 28 (5), 1470-1483, 2016 | 33* | 2016 |
| An evaluation of graph clustering methods for unsupervised term discovery. V Lyzinski, G Sell, A Jansen INTERSPEECH, 3209-3213, 2015 | 32 | 2015 |
Carey E. PriebeProfessor of Applied Mathematics and Statistics, Johns Hopkins UniversityCorreu electrònic verificat a jhu.edu