Detection of a planted dense subgraph in a random graph is a fundamental...
We consider a symmetric mixture of linear regressions with random sample...
Planted dense cycles are a type of latent structure that appears in many...
We propose an efficient algorithm for graph matching based on similarity...
We propose a new procedure for testing whether two networks are
edge-cor...
This paper deals with the problem of graph matching or network alignment...
Recovering a planted vector v in an n-dimensional random subspace of
ℝ^N...
Graph matching, also known as network alignment, refers to finding a
bij...
In applications such as rank aggregation, mixture models for permutation...
We study minimax estimation of two-dimensional totally positive
distribu...
We analyze a new spectral graph matching algorithm, GRAph Matching by
Pa...
Graph matching aims at finding the vertex correspondence between two
unl...
Monge matrices and their permuted versions known as pre-Monge matrices
n...
Many applications, including rank aggregation, crowd-labeling, and graph...
Many applications, including rank aggregation and crowd-labeling, can be...
There has been a recent surge of interest in studying permutation-based
...
Pairwise comparison data arises in many domains, including tournament
ra...
Given a matrix the seriation problem consists in permuting its rows in s...