research
∙
08/25/2023
Gotta match 'em all: Solution diversification in graph matching matched filters
We present a novel approach for finding multiple noisily embedded templa...
share
research
∙
08/20/2022
Adversarial contamination of networks in the setting of vertex nomination: a new trimming method
As graph data becomes more ubiquitous, the need for robust inferential g...
research
∙
08/18/2022
Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels
Many two-sample network hypothesis testing methodologies operate under t...
research
∙
12/23/2021
Signed and Unsigned Partial Information Decompositions of Continuous Network Interactions
We investigate the partial information decomposition (PID) framework as ...
research
∙
06/23/2021
Leveraging semantically similar queries for ranking via combining representations
In modern ranking problems, different and disparate representations of t...
research
∙
01/29/2021
Subgraph nomination: Query by Example Subgraph Retrieval in Networks
This paper introduces the subgraph nomination inference task, in which e...
research
∙
10/24/2020
Vertex nomination between graphs via spectral embedding and quadratic programming
Given a network and a subset of interesting vertices whose identities ar...
research
∙
08/01/2020
The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks
Spectral inference on multiple networks is a rapidly-developing subfield...
research
∙
04/29/2020
On the role of features in vertex nomination: Content and context together are better (sometimes)
Vertex nomination is a lightly-supervised network information retrieval ...
research
∙
02/23/2020
On a complete and sufficient statistic for the correlated Bernoulli random graph model
Inference on vertex-aligned graphs is of wide theoretical and practical ...
research
∙
02/05/2020
Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question
Graph matching consists of aligning the vertices of two unlabeled graphs...
research
∙
05/06/2019
Vertex Nomination, Consistent Estimation, and Adversarial Modification
Given a pair of graphs G_1 and G_2 and a vertex set of interest in G_1, ...
research
∙
12/26/2018
Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks
Given a pair of graphs with the same number of vertices, the inexact gra...
research
∙
07/24/2018
Tractable Graph Matching via Soft Seeding
The graph matching problem aims to discover a latent correspondence betw...
research
∙
03/06/2018
Matched Filters for Noisy Induced Subgraph Detection
We consider the problem of finding the vertex correspondence between two...
research
∙
02/14/2018
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
Suppose that one particular block in a stochastic block model is deemed ...
research
∙
11/15/2017
On consistent vertex nomination schemes
Given a vertex of interest in a network G_1, the vertex nomination probl...
research
∙
09/16/2017
Statistical inference on random dot product graphs: a survey
The random dot product graph (RDPG) is an independent-edge random graph ...
research
∙
05/09/2017
Semiparametric spectral modeling of the Drosophila connectome
We present semiparametric spectral modeling of the complete larval Droso...
research
∙
05/01/2017
Vertex Nomination Via Local Neighborhood Matching
Consider two networks on overlapping, non-identical vertex sets. Given v...
research
∙
07/05/2016
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
Given a graph in which a few vertices are deemed interesting a priori, t...
research
∙
05/08/2016
Information Recovery in Shuffled Graphs via Graph Matching
While many multiple graph inference methodologies operate under the impl...
research
∙
03/12/2016
Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements
Manifold learning and dimensionality reduction techniques are ubiquitous...
research
∙
08/18/2015
Scalable Out-of-Sample Extension of Graph Embeddings Using Deep Neural Networks
Several popular graph embedding techniques for representation learning a...
research
∙
03/07/2015
Community Detection and Classification in Hierarchical Stochastic Blockmodels
We propose a robust, scalable, integrated methodology for community dete...
research
∙
02/11/2015
Fast Embedding for JOFC Using the Raw Stress Criterion
The Joint Optimization of Fidelity and Commensurability (JOFC) manifold ...
research
∙
05/13/2014
Graph Matching: Relax at Your Own Risk
Graph matching---aligning a pair of graphs to minimize their edge disagr...
research
∙
01/16/2014
Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability
We present a novel approximate graph matching algorithm that incorporate...
research
∙
10/04/2013
Spectral Clustering for Divide-and-Conquer Graph Matching
We present a parallelized bijective graph matching algorithm that levera...
research
∙
10/02/2013
Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding
Vertex clustering in a stochastic blockmodel graph has wide applicabilit...
research
∙
05/31/2013
A central limit theorem for scaled eigenvectors of random dot product graphs
We prove a central limit theorem for the components of the largest eigen...
research
∙
09/03/2012
