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
∙
09/02/2022
Unbiased estimation for additive exposure models
Causal inference methods have been applied in various fields where resea...
research
∙
05/10/2021
Causal Inference under Network Interference with Noise
Increasingly, there is a marked interest in estimating causal effects un...
research
∙
05/05/2020
Bias-Variance Tradeoffs in Joint Spectral Embeddings
Latent position models and their corresponding estimation procedures off...
research
∙
02/13/2020
Estimation of the Epidemic Branching Factor in Noisy Contact Networks
Many fundamental concepts in network-based epidemic models depend on the...
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
∙
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
∙
09/06/2016
Law of Large Graphs
Estimating the mean of a population of graphs based on a sample is a cor...
research
∙
06/25/2015
Analyzing statistical and computational tradeoffs of estimation procedures
The recent explosion in the amount and dimensionality of data has exacer...
research
∙
05/23/2014
Empirical Bayes Estimation for the Stochastic Blockmodel
Inference for the stochastic blockmodel is currently of burgeoning inter...
research
∙
10/04/2013
Spectral Clustering for Divide-and-Conquer Graph Matching
We present a parallelized bijective graph matching algorithm that levera...
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
∙
12/05/2012
Universally consistent vertex classification for latent positions graphs
In this work we show that, using the eigen-decomposition of the adjacenc...
research
∙
11/15/2012
Statistical inference on errorfully observed graphs
Statistical inference on graphs is a burgeoning field in the applied and...
research
∙
07/29/2012
Universally Consistent Latent Position Estimation and Vertex Classification for Random Dot Product Graphs
In this work we show that, using the eigen-decomposition of the adjacenc...
research
∙
08/10/2011
