Add to ORKGMotivated by the problem of matching vertices in two correlated Erd\H{o}s-R\'enyi graphs, we study the problem of matching two correlated Gaussian Wigner matrices. We propose an iterative matching algorithm, which succeeds in polynomial time as long as the correlation between the two Gaussian matrices does not vanish. Our result is the first polynomial time algorithm that solves a graph matching type of problem when the correlation is an arbitrarily small constant.Comment: 51 page
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
A matching M in a graph is a subset of edges such that no two edges in M are incident on the same ve...
We study the fundamental limits for reconstruction in weighted graph (or matrix) database alignment....
In the graph matching problem we observe two graphs $G,H$ and the goal is to find an assignment (or ...
In the graph matching problem we observe two graphs $G,H$ and the goal is to find an assignment (or ...
This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi grap...
Motivated by alignment of correlated sparse random graphs, we introduce a hypothesis testing problem...
The graph matching problem is, given two graphs, to find the bijection between the vertex sets that ...
The Graph Matching problem is a robust version of the Graph Isomorphism problem: given two not-neces...
33 pages. Typos corrected, some new figures, some remarks and explanations detailed, minor changes i...
Presented on September 24, 2018 at 11:00 a.m. in the Pettit Microelectronics Research Center, room 1...
This thesis focuses on statistical inference in graphs (or matrices) in high dimensionand studies th...
In this work, we propose an efficient two-stage algorithm solving a joint problem of correlation det...
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of th...
International audienceRandom graph alignment refers to recovering the underlying vertex corresponden...
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
A matching M in a graph is a subset of edges such that no two edges in M are incident on the same ve...
We study the fundamental limits for reconstruction in weighted graph (or matrix) database alignment....
In the graph matching problem we observe two graphs $G,H$ and the goal is to find an assignment (or ...
In the graph matching problem we observe two graphs $G,H$ and the goal is to find an assignment (or ...
This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi grap...
Motivated by alignment of correlated sparse random graphs, we introduce a hypothesis testing problem...
The graph matching problem is, given two graphs, to find the bijection between the vertex sets that ...
The Graph Matching problem is a robust version of the Graph Isomorphism problem: given two not-neces...
33 pages. Typos corrected, some new figures, some remarks and explanations detailed, minor changes i...
Presented on September 24, 2018 at 11:00 a.m. in the Pettit Microelectronics Research Center, room 1...
This thesis focuses on statistical inference in graphs (or matrices) in high dimensionand studies th...
In this work, we propose an efficient two-stage algorithm solving a joint problem of correlation det...
When two graphs have a correlated Bernoulli distribution, we prove that the alignment strength of th...
International audienceRandom graph alignment refers to recovering the underlying vertex corresponden...
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents...
A matching M in a graph is a subset of edges such that no two edges in M are incident on the same ve...
We study the fundamental limits for reconstruction in weighted graph (or matrix) database alignment....