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. 2203.14573
  4. Cited By
Detection threshold for correlated Erdős-Rényi graphs via densest
  subgraphs

Detection threshold for correlated Erdős-Rényi graphs via densest subgraphs

28 March 2022
Jian Ding
Hangyu Du
ArXivPDFHTML

Papers citing "Detection threshold for correlated Erdős-Rényi graphs via densest subgraphs"

13 / 13 papers shown
Title
Robust random graph matching in dense graphs via vector approximate
  message passing
Robust random graph matching in dense graphs via vector approximate message passing
Zhangsong Li
69
1
0
21 Dec 2024
Testing Dependency of Weighted Random Graphs
Testing Dependency of Weighted Random Graphs
Mor Oren
Vered Paslev
Wasim Huleihel
28
1
0
23 Sep 2024
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
Dong Huang
Xianwen Song
Pengkun Yang
24
1
0
08 Jun 2024
The Umeyama algorithm for matching correlated Gaussian geometric models
  in the low-dimensional regime
The Umeyama algorithm for matching correlated Gaussian geometric models in the low-dimensional regime
Shuyang Gong
Zhangsong Li
19
4
0
23 Feb 2024
Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
Low-Degree Hardness of Detection for Correlated Erdős-Rényi Graphs
Jian Ding
Hangyu Du
Zhangsong Li
19
10
0
27 Nov 2023
Efficiently matching random inhomogeneous graphs via degree profiles
Efficiently matching random inhomogeneous graphs via degree profiles
Jian Ding
Yumou Fei
Yuanzheng Wang
13
2
0
16 Oct 2023
A polynomial-time iterative algorithm for random graph matching with
  non-vanishing correlation
A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
Jian Ding
Zhang Li
19
13
0
01 Jun 2023
A Survey on the Densest Subgraph Problem and Its Variants
A Survey on the Densest Subgraph Problem and Its Variants
Tommaso Lanciano
Atsushi Miyauchi
Adriano Fazzone
Francesco Bonchi
11
38
0
25 Mar 2023
A polynomial time iterative algorithm for matching Gaussian matrices
  with non-vanishing correlation
A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
Jian Ding
Zhang Li
10
8
0
28 Dec 2022
Statistical limits of correlation detection in trees
Statistical limits of correlation detection in trees
Luca Ganassali
Laurent Massoulié
G. Semerjian
30
16
0
27 Sep 2022
Matching recovery threshold for correlated random graphs
Matching recovery threshold for correlated random graphs
Jian Ding
Hangyu Du
27
24
0
29 May 2022
Random Graph Matching in Geometric Models: the Case of Complete Graphs
Random Graph Matching in Geometric Models: the Case of Complete Graphs
Haoyu Wang
Yihong Wu
Jiaming Xu
Israel Yolou
29
27
0
22 Feb 2022
Correlated Stochastic Block Models: Exact Graph Matching with
  Applications to Recovering Communities
Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communities
Miklós Z. Rácz
Anirudh Sridhar
24
29
0
14 Jul 2021
1