ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1907.08883
  4. Cited By
Spectral Graph Matching and Regularized Quadratic Relaxations II:
  Erdős-Rényi Graphs and Universality

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

20 July 2019
Z. Fan
Cheng Mao
Yihong Wu
Jiaming Xu
ArXiv (abs)PDFHTML

Papers citing "Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality"

8 / 8 papers shown
Title
The feasibility of multi-graph alignment: a Bayesian approach
Louis Vassaux
Laurent Massoulié
56
1
0
24 Feb 2025
Spectral Graph Matching and Regularized Quadratic Relaxations I: The
  Gaussian Model
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Z. Fan
Cheng Mao
Yihong Wu
Jiaming Xu
42
25
0
20 Jul 2019
(Nearly) Efficient Algorithms for the Graph Matching Problem on
  Correlated Random Graphs
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
Boaz Barak
Chi-Ning Chou
Zhixian Lei
T. Schramm
Yueqi Sheng
35
66
0
07 May 2018
Analysis of a Canonical Labeling Algorithm for the Alignment of
  Correlated Erdős-Rényi Graphs
Analysis of a Canonical Labeling Algorithm for the Alignment of Correlated Erdős-Rényi Graphs
Osman Emre Dai
Daniel Cullina
Negar Kiyavash
Matthias Grossglauser
30
13
0
25 Apr 2018
Exact alignment recovery for correlated Erdős-Rényi graphs
Exact alignment recovery for correlated Erdős-Rényi graphs
Daniel Cullina
Negar Kiyavash
44
80
0
18 Nov 2017
Improved Achievability and Converse Bounds for Erdős-Rényi Graph
  Matching
Improved Achievability and Converse Bounds for Erdős-Rényi Graph Matching
Daniel Cullina
Negar Kiyavash
41
112
0
02 Feb 2016
Statistical-Computational Tradeoffs in Planted Problems and Submatrix
  Localization with a Growing Number of Clusters and Submatrices
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
Yudong Chen
Jiaming Xu
238
216
0
06 Feb 2014
A path following algorithm for the graph matching problem
A path following algorithm for the graph matching problem
M. Zaslavskiy
Francis R. Bach
Jean-Philippe Vert
145
422
0
23 Jan 2008
1