| Publication | Date of Publication | Type |
|---|
| On seeded subgraph-to-subgraph matching: The ssSGM Algorithm and matchability information theory | 2023-06-06 | Paper |
On a complete and sufficient statistic for the correlated Bernoulli random graph model
Electronic Journal of Statistics | 2021-08-09 | Paper |
Vertex nomination: the canonical sampling and the extended spectral nomination schemes
Computational Statistics and Data Analysis | 2020-03-10 | Paper |
| Statistical inference on random dot product graphs: a survey | 2018-11-22 | Paper |
Statistical inference on random dot product graphs: a survey
(available as arXiv preprint) | 2018-11-22 | Paper |
| Alignment Strength and Correlation for Graphs | 2018-08-25 | Paper |
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 (JMLR) | 2016-11-22 | Paper |
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 (JMLR) | 2016-11-22 | Paper |
On the incommensurability phenomenon
Journal of Classification | 2016-10-28 | Paper |
Vertex nomination schemes for membership prediction
The Annals of Applied Statistics | 2016-01-04 | Paper |
Vertex nomination schemes for membership prediction
The Annals of Applied Statistics | 2016-01-04 | Paper |
| Seeded graph matching for correlated Erdős-Rényi graphs | 2015-05-06 | Paper |
Seeded graph matching for correlated Erdős-Rényi graphs
(available as arXiv preprint) | 2015-05-06 | Paper |
Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
SIAM Journal on Matrix Analysis and Applications | 2013-06-27 | Paper |
A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
Journal of the American Statistical Association | 2012-11-09 | Paper |
| Counting Spanning Trees of Threshold Graphs | 2012-08-20 | Paper |
The reset disambiguation policy for navigating stochastic obstacle fields
Naval Research Logistics | 2011-06-09 | Paper |
Efficient, optimal stochastic-action selection when limited by an action budget
Mathematical Methods of Operations Research | 2010-09-21 | Paper |
The genus of a digital image boundary is determined by its foreground, background, and Reeb graphs
Discrete & Computational Geometry | 2007-06-21 | Paper |
A Genus Bound for Digital Image Boundaries
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Random disambiguation paths for traversing a mapped hazard field
Naval Research Logistics | 2005-11-07 | Paper |
On the growth rate of generalized Fibonacci numbers
Advances in Difference Equations | 2005-09-13 | Paper |
Rank, term rank, and chromatic number
Discrete Mathematics | 2002-08-29 | Paper |
On poset similarity
Discrete Mathematics | 2001-05-02 | Paper |
Reflecting the pascal matrix about its main antidiagonal
Linear and Multilinear Algebra | 2000-06-21 | Paper |
The Moore--Penrose Generalized Inverse for Sums of Matrices
SIAM Journal on Matrix Analysis and Applications | 2000-03-20 | Paper |
Affine isomorphism for partially ordered sets
Order | 2000-02-14 | Paper |
The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph match
(available as arXiv preprint) | N/A | Paper |
