Vince Lyzinski

Assistant Professor
Department of Mathematics and Statistics
University of Massachusetts, Amherst
1446 Lederle Graduate Research Tower
710 N. Pleasant Street
Amherst, MA 01003-9305
email: vlyzinski at umass dot edu

Education

  • 2006, Bachelor of Science, University of Notre Dame, Department of Mathematics.
  • 2007, Master of Science, Johns Hopkins University, Department of Mathematics.
  • 2011, Master of Science in Engineering, The Johns Hopkins University, Department of Applied Mathematics and Statistics.
  • 2013, Ph.D., The Johns Hopkins University, Department of Applied Mathematics and Statistics
  • Research Interests

    Random graph inference, statistical machine learning, graph matching algorithms, Markov chains, probability, combinatorics

    Publications

    Submitted papers/preprints

    1. D. E. Fishkind, L. Meng, A. Sun, C. E. Priebe, V. Lyzinski : Alignment strength and correlation for graphs. arXiv 1808.08502 (2018). Link.
    2. C. E. Priebe, Y. Park, J. T. Vogelstein, J. M . Conroy, V. Lyzinski, M. Tang, A. Athreya, J. Cape, E. Bridgeford: On a `Two-Truths' Phenomenon in Spectral Graph Clustering. arXiv 1808:07801 (2018). Link.
    3. F. Fang, D. L. Sussman, V. Lyzinski: Tractable Graph Matching via Soft Seeding. arXiv 1807.09299 (2018). Link.
    4. D. L. Sussman, V. Lyzinski, Y. Park, C. E. Priebe: Matched filters for noisy induced subgraph detection. arXiv 1803.02423 (2018). Link
    5. J. Yoder, L. Chen, H. Pao, E. Bridgeford, K. Levin, D. E. Fishkind, C. E. Priebe, V. Lyzinski : Vertex nomination: The canonical sampling and the extended spectral nomination schemes. arXiv 1802.04960 (2018). Link.
    6. V. Lyzinski, K. Levin, C.E. Priebe: On Consistent Vertex Nomination Schemes. arXiv 1711.05610 (2017). Link
    7. C. E. Priebe, Y. Park, M. Tang, A. Athreya, V. Lyzinski, J. T. Vogelstein, Y. Qin, B. Cocanougher, K. Eichler, M. Zlatic, A. Cardona: Semiparametric spectral modeling of the Drosophila connectome. arXiv 1705.03297 (2017). Link.
    8. V. Lyzinski , D. L. Sussman: Matchability of heterogeneous networks pairs. arXiv 1705.02294 (2018). Link.
    9. H. G. Pastolic, Y. Park, V. Lyzinski , C. E. Priebe: Vertex Nomination Via Local Neighborhood Matching. arXiv 1705.00674 (2017). Link.
    10. K. Levin, A. Athreya, M. Tang, V. Lyzinski, C.E. Priebe: A central limit theorem for an omnibus embedding of random dot product graphs. arXiv:1705.09355, (2017). Link.
    11. A. Athreya, M. Tang, V. Lyzinski, Y. Park, B. Lewis, M. Kane, C. E. Priebe: Numerical Tolerance for Spectral Decompositions of Random Dot Product Graphs. arXiv 1608.00451 (2016). Link.
    12. V. Lyzinski, S. Adali, J. T. Vogelstein, Y. Park and C. E. Priebe: Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability. arXiv 1401.3813 (2014). Link

    Refereed journal publications

    1. P. Rastogi, A. Poliak, V. Lyzinski, B. Van Durme: Neural Variational Entity Set Expansion for Automatically Populated Knowledge Graphs. Information Retrieval Journal, accepted for publication, (2018) [abstract can be found. here].
    2. D. E. Fishkind, S. Adali, H. G. Patsolic, L. Meng, D. Singh, V. Lyzinski, C.E. Priebe: Seeded Graph Matching. Pattern Recognition, accepted for publication, (2018). Link.
    3. V. Lyzinski: Information Recovery in Shuffled Graphs via Graph Matching. IEEE Transactions on Information Theory, 64(5), pp.3254-3273, (2018) . Link.
    4. A. Athreya, D.E. Fishkind, K. Levin, V. Lyzinski, Y. Park, Y. Qin, D.L. Sussman, M. Tang, J.T. Vogelstein, C.E. and Priebe: Statistical Inference on Random Dot Product Graphs: A Survey. Journal of Machine Learning Research, Vol. 18, pp. 1-92 (2018). Link.
    5. A. Jansen, G. Sell, V. Lyzinski: Scalable Out-of-Sample Extension of Graph Embeddings Using Deep Neural Networks. Pattern Recognition Letters, Vol. 94(15), pp. 1-6 (2017). Link.
    6. K. Levin and V. Lyzinski: Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements. IEEE Transactions on Signal Processing, Vol. 65(8), (2017). Link.
    7. V. Lyzinski, M. Tang, A. Athreya, Y. Park and C. E. Priebe: Community Detection and Classification in Hierarchical Stochastic Blockmodels. IEEE Transactions on Network Science and Engineering, 4(1), pp.13-26, (2017). Link. Data, code and figures are presented in more detail here.
    8. V. Lyzinski, Y. Park, C. E. Priebe and Michael Trosset: Fast Embedding for JOFC Using the Raw Stress Criterion. Journal of Computational and Graphical Statistics, 26(4), pp. 786-802, (2017). Link.
    9. D. Zheng, D. Mhembere, V. Lyzinski, J. Vogelstein, C. E. Priebe, and R. Burns: Semi-External Memory Sparse Matrix Multiplication on Billion-node Graphs in a Multicore Architecture. IEEE Transactions in Parallel and Distributed Systems, Vol. 28(5), pp 1470-1483, (2017). Link.
    10. V. Lyzinski, K. Levin, D. E. Fishkind and C. E. Priebe: On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching. Journal of Machine Learning Research, 17(179), pp.1-34, (2016). Link.
    11. M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski and C. E. Priebe: A semiparametric two-sample hypothesis testing problem for random dot product graphs. Journal of Computational and Graphical Statistics, 26(2), 344-354 (2017). Link
    12. M. Tang, A. Athreya, D. L. Sussman, V. Lyzinski and C. E. Priebe: A nonparametric two-sample hypothesis testing problem for random dot product graphs. Bernoulli Journal, Vol. 23 no. 3, 1599-1630, (2017). Link
    13. V. Lyzinski, D. E. Fishkind, M. Fiori, J. T. Vogelstein, C. E. Priebe and G. Sapiro: Graph Matching: Relax at Your Own Risk. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(1), pp.60-73., (2016). Link
    14. L. Chen, J. T. Vogelstein, V. Lyzinski, C. E. Priebe: A Joint Graph Inference Case Study: the C.elegans Chemical and Electrical Connectomes. Worm, 5(2), p. e1142041, (2015). doi: 10.1080/21624054.2016.1142041. Link.
    15. J. T. Vogelstein, J. M. Conroy, V. Lyzinski, L. J. Podrazik, S. G. Kratzer, E. T. Harley, D. E. Fishkind, R. J. Vogelstein, C. E. Priebe: Fast Approximate Quadratic Programming for Graph Matching. PLOS One, 10(4): e0121002. doi:10.1371/journal.pone.0121002 (2015). Link
    16. D. E. Fishkind, V. Lyzinski, H. Pao, L. Chen and C. E. Priebe: Vertex Nomination Schemes for Membership Prediction. Annals of Applied Statistics, 9.3 pp 1510-1532 (2015). Link
    17. V. Lyzinski, D. Sussman, D. E. Fishkind, H. Pao, L. Chen, J. Vogelstein, Y. Park and C. E. Priebe: Spectral Clustering for Divide-and-Conquer Graph Matching. Parallel Computing, doi:10.1016/j.parco.2015.03.004 (2015). Link
    18. J. A. Fill and V. Lyzinski: Strong Stationary Duality for Diffusion Processes. Journal of Theoretical Probability, pp 1-41 (2014). Link
    19. V. Lyzinski, D. Sussman, M. Tang, A. Athreya and C. E. Priebe: Perfect clustering for stochastic block model graphs via adjacency spectral embedding. Electronic Journal of Statistics, 8, pp 2905-2922 (2014). Link
    20. V. Lyzinski, D. E. Fishkind and C. E. Priebe: Seeded graph matching for correlated Erdos-Renyi graphs. Journal of Machine Learning Research, 15, pp 3513-3540 (2014). Link
    21. A. Athreya, C. E. Priebe, M. Tang, V. Lyzinski, D. J. Marchette and D. L. Sussman: A limit theorem for scaled eigenvectors of random dot product graphs. Sankhya A, pp 1-18, (2013). Link
    22. A. Godbole, S. Gutekunst, V. Lyzinski and Y. Zhuang: Logarithmic representability of integers as k-sums. Integers: The Electronic Journal of Combinatorial Number Theory, 15A: Proceedings of Integers 2013: The Erdős Centennial Conference. Link
    23. A. Godbole, C. M. Lim, V. Lyzinski and N. Triantafillou: Sharp threshold asymptotics for the emergence of additive bases. Integers: The Electronic Journal of Combinatorial Number Theory, 13 (2013), electronic. Link
    24. J. A. Fill and V. Lyzinski: Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings. Journal of Theoretical Probability (2012). DOI: 10.1007/s10959-012-0457-9. Link

    Refereed conference publications

    1. D. Sussman, V. Lyzinski, Y. Park, C. E. Priebe: Matched Filters for Noisy Indued Subgraph Detection. GTA³ 2018: Workshop on Graph Techniques for Adversarial Activity Analytics, in conjuction with 11th ACM International Conference on Web Search and Data Mining, Marina Del Rey, CA, Feb 9, 2018. (won the best paper award) Link.
    2. J. Douglas, B. Zimmerman, A. Kopylov, J. Xu, D. Sussman, V. Lyzinski: Metrics for Evaluating Network Alignment. GTA³ 2018: Workshop on Graph Techniques for Adversarial Activity Analytics, in conjuction with 11th ACM International Conference on Web Search and Data Mining, Marina Del Rey, CA, Feb 9, 2018. Link.
    3. K. Levin, A. Avanti, M. Tang, V. Lyzinski, C. E. Priebe: A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs. In 2017 IEEE International Conference on Data Mining Workshops (ICDMW), pp. 964-967. IEEE, 2017. Link.
    4. V. Lyzinski, G. Sell, and A. Jansen: An Evaluation of Graph Clustering Methods for Unsupervised Term Discovery. Proceedings of Interspeech, Dresden, Germany, 2015. Link.