The problem of aligning Erdos-Renyi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through a random permutation of their vertices. We study a polynomial time message-passing algorithm devised to solve the inference problem of partially recovering the hidden permutation, in the sparse regime with constant average degrees. We perform extensive numerical simulations to determine the range of parameters in which this algorithm achieves partial recovery. We also introduce a generalized ensemble of correlated random graphs with prescribed degree distributions, and extend the algorithm to this case
This paper considers the inverse problem with observed variables Y = BGX circle plus Z, where B-G is...
Graph matching is a generalization of the classic graph isomorphism problem. By using only their str...
Presented on September 24, 2018 at 11:00 a.m. in the Pettit Microelectronics Research Center, room 1...
The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph ...
International audienceRandom graph alignment refers to recovering the underlying vertex corresponden...
38 pages, 9 figuresInternational audienceMotivated by alignment of correlated sparse random graphs, ...
This thesis focuses on statistical inference in graphs (or matrices) in high dimensionand studies th...
This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi grap...
The Graph Matching problem is a robust version of the Graph Isomorphism problem: given two not-neces...
International audienceIn this paper, we consider the graph alignment problem, which is the problem o...
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) f...
We propose and investigate a unifying class of sparse random graph models, based on a hidden colorin...
We study the consistency of graph matching for estimating a latent alignment function be-tween the v...
In approximate graph matching, the goal is to find the best correspondence between the labels of two...
33 pages. Typos corrected, some new figures, some remarks and explanations detailed, minor changes i...
This paper considers the inverse problem with observed variables Y = BGX circle plus Z, where B-G is...
Graph matching is a generalization of the classic graph isomorphism problem. By using only their str...
Presented on September 24, 2018 at 11:00 a.m. in the Pettit Microelectronics Research Center, room 1...
The problem of aligning Erd\"os-R\'enyi random graphs is a noisy, average-case version of the graph ...
International audienceRandom graph alignment refers to recovering the underlying vertex corresponden...
38 pages, 9 figuresInternational audienceMotivated by alignment of correlated sparse random graphs, ...
This thesis focuses on statistical inference in graphs (or matrices) in high dimensionand studies th...
This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi grap...
The Graph Matching problem is a robust version of the Graph Isomorphism problem: given two not-neces...
International audienceIn this paper, we consider the graph alignment problem, which is the problem o...
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) f...
We propose and investigate a unifying class of sparse random graph models, based on a hidden colorin...
We study the consistency of graph matching for estimating a latent alignment function be-tween the v...
In approximate graph matching, the goal is to find the best correspondence between the labels of two...
33 pages. Typos corrected, some new figures, some remarks and explanations detailed, minor changes i...
This paper considers the inverse problem with observed variables Y = BGX circle plus Z, where B-G is...
Graph matching is a generalization of the classic graph isomorphism problem. By using only their str...
Presented on September 24, 2018 at 11:00 a.m. in the Pettit Microelectronics Research Center, room 1...