Faculty

Donniell Fishkind

Associate Research Professor &  Director of Undergraduate Studies

Research Interests

  • Graph Theory
  • Matrix Analysis
Education
  • Ph.D. 1998, The Johns Hopkins University
Experience
  • 2018 - Present:  Part-time Lecturer, A&S Hold
  • 2010 - Present:  Director of Undergraduate Studies, Applied Mathematics and Statistics Department
Research Areas
  • COMBINATORICS
  • GRAPH theory
  • LINEAR algebra
  • Matrix analysis
  • Partially-ordered sets
  • Probablistic path planning
  • Topology correction in medical imaging
Awards
  • 2014:  Department of Applied Mathematics and Statistics Teaching Award
  • 2013:  William H. Huggins Excellence in Teaching Award
  • 2012:  Joel Dean Excellence in Teaching Award
  • 2011:  Joel Dean Excellence in Teaching Award
  • 2011:  Department of Applied Mathematics and Statistics Teaching Award
  • 2010:  Johns Hopkins University Alumni Association Excellence in Teaching Award
  • 2009:  Department of Applied Mathematics and Statistics Teaching Award
  • 2009:  Staff Excellence Award for Leadership and Service (Johns Hopkins SGA)
  • 2006:  Robert B. Pond Sr. Excellence in Teaching Award
Journal Articles
  • Athreya A, Fishkind DE, Tang M, Priebe CE, Park Y, Vogelstein JT, Levin K, Lyzinski V, Qin Y, Sussman DL (2018).  Statistical inference on random dot product graphs: A survey.  Journal of Machine Learning Research.  18.
  • Lyzinski V, Levin K, Fishkind DE, Priebe CE (2016).  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.
  • Fishkind DE, Shen C, Park Y, Priebe CE (2016).  On the Incommensurability Phenomenon.  Journal of Classification.  33(2).
  • Lyzinski V, Fishkind DE, Fiori M, Vogelstein JT, Priebe CE, Sapiro G (2016).  Graph Matching: Relax at Your Own Risk.  IEEE Transactions on Pattern Analysis and Machine Intelligence.  38(1).
  • Fishkind DE, Lyzinski V, Pao H, Chen L, Priebe CE (2015).  Vertex nomination schemes for membership prediction.  Annals of Applied Statistics.  9(3).
  • Lyzinski V, Sussman DL, Fishkind DE, Pao H, Chen L, Vogelstein JT, Park Y, Priebe CE (2015).  Spectral clustering for divide-and-conquer graph matching.  Parallel Computing.  47.
  • Vogelstein JT, Conroy JM, Lyzinski V, Podrazik LJ, Kratzer SG, Harley ET, Fishkind DE, Vogelstein RJ, Priebe CE (2015).  Fast Approximate Quadratic programming for graph matching.  PLoS ONE.  10(4).
  • Lyzinski V, Fishkind DE, Priebe CE (2015).  Seeded graph matching for correlated Erdo″s-Rényi graphs.  Journal of Machine Learning Research.  15.
  • Lyzinski V, Fishkind D, Priebe C (2014).  Seeded graph matching for correlated Erdos-Renyi graphs.  Journal of Machine Learning Research.  15(Nov).  3513-3540.
  • Lyzinski V, Fishkind D, Priebe C (2013).  Seeded graph matching for correlated Erdos-Rényi graphs.  arXiv.org.
  • Fishkind D, D.L.Sussman , M.Tang , Vogelstein J, Priebe C (2013).  Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown.  Siam Journal on Matrix Analysis and Applications.  34.  23-39.
  • Sussman DL, Tang M, Fishkind DE, Priebe CE (2012).  A consistent adjacency spectral embedding for stochastic blockmodel graphs.  Journal of the American Statistical Association.  107(499).
  • Fishkind DE, Sussman DL, Tang M, Vogelstein JT, Priebe CE (2012).  Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown.  SIAM Journal on Matrix Analysis and Applications.  34(1).
  • Sussman DL, Tang M, Fishkind D, Priebe C (2012).  A consistent adjacency spectral embedding for stochastic blockmodel graphs.  Journal of the American Statistical Association.  1119-1128.
  • Fishkind D, Sussman DL, Tang M, Vogelstein J, Priebe C (2012).  Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown.  SIAM Journal on Matrix Analysis and Applicationsins.  stat.ME.
  • D.L.Sussman , M.Tang , Fishkind D, Priebe C (2012).  A consistent adjacency spectral embedding for stochastic blockmodel graphs.  Journal of the American Statistical Association.  107.  1119-1128.
  • Aksakalli V, Fishkind DE, Priebe CE, Ye X (2011).  The reset disambiguation policy for navigating stochastic obstacle fields.  Naval Research Logistics.  58(4).
  • Aksakalli V, Fishkind D, Priebe C, Ye X (2011).  The Reset Disambiguation Policy for Navigating Stochastic Obstacle Fields.  Naval Research Logistics.  58(4).  389-399.
  • Ye X, Fishkind DE, Abrams L, Priebe CE (2011).  Sensor information monotonicity in disambiguation protocols.  Journal of the Operational Research Society.  62(1).
  • Ye X, Fishkind D, Abrams L, Priebe C (2011).  Sensor information monotonicity in disambiguation protocols.  Journal of the Operational Research Society.  62(1).  142-151.
  • Blatz J, Fishkind DE, Priebe CE (2010).  Efficient, optimal stochastic-action selection when limited by an action budget.  Mathematical Methods of Operations Research.  72(1).
  • Blatz J, Fishkind D, Priebe C (2010).  Efficient, optimal stochastic-action selection when limited by an action budget.  Mathematical Methods of Operations Research.  72(1).  63-74.
  • Fishkind D, Priebe C, Giles KE, Smith LN, Aksakalli V (2007).  Disambiguation protocols based on risk simulation.  Ieee Transactions on Systems Man and Cybernetics Part a-Systems and Humans.  37(5).  814-823.
  • Fishkind DE, Priebe CE, Giles KE, Smith LN, Aksakalli V (2007).  Disambiguation protocols based on risk simulation.  IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.  37(5).
  • Abrams L, Fishkind DE (2007).  The genus of a digital image boundary is determined by its foreground, background, and reeb graphs.  Discrete and Computational Geometry.  37(4).
  • Abrams L, Fishkind DE (2005).  A genus bound for digital image boundaries.  SIAM Journal on Discrete Mathematics.  19(3).
  • Priebe C, Fishkind D, Abrams L, Piatko CD (2005).  Random disambiguation paths for traversing a mapped hazard field.  Naval Research Logistics.  52(3).  285-292.
  • Priebe CE, Fishkind DE, Abrams L, Piatko CD (2005).  Random disambiguation paths for traversing a mapped hazard field.  Naval Research Logistics.  52(3).
  • Fishkind D (2004).  On the growth rate of generalized Fibonacci numbers.  Advances in Difference Equations.  2004(4).
  • Abrams L, Fishkind DE, Priebe CE (2004).  The generalized spherical homeomorphism theorem for digital images.  IEEE Transactions on Medical Imaging.  23(5).
  • Abrams L, Fishkind D, Priebe C (2004).  The generalized spherical homeomorphism theorem for digital images..  IEEE transactions on medical imaging.  23(5).  655-657.
  • Fishkind D, Hamkins JD, Montero B (2002).  New inconsistencies in infinite utilitarianism: Is every world good, bad or neutral?.  Australasian Journal of Philosophy.  80(2).
  • Abrams L, Fishkind D, Priebe C (2002).  A proof of the spherical homeomorphism conjecture for surfaces.  IEEE transactions on medical imaging.  21(12).  1564-1566.
  • Fishkind DE, Kotlov A (2002).  Rank, term rank, and chromatic number.  Discrete Mathematics.  250(1-3).
  • Abrams L, Fishkind DE, Valdes-Leon S (2000).  Reflecting the Pascal matrix about its main antidiagonal.  Linear and Multilinear Algebra.  47(2).
  • Fishkind DE (2000).  On poset similarity.  Discrete Mathematics.  220(1-3).
  • Fill JA, Fishkind DE (1999).  The Moore-Penrose generalized inverse for sums of matrices.  SIAM Journal on Matrix Analysis and Applications.  21(2).
  • Fill JA, Fishkind DE, Scheinerman ER (1998).  Affine Isomorphism for Partially Ordered Sets.  Order.  15(2).
Back to top