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. 1310.0532
  4. Cited By
Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency
  Spectral Embedding

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

2 October 2013
V. Lyzinski
D. Sussman
M. Tang
A. Athreya
Carey Priebe
ArXivPDFHTML

Papers citing "Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding"

20 / 20 papers shown
Title
Detection of Model-based Planted Pseudo-cliques in Random Dot Product
  Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding
Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding
Tong Qi
V. Lyzinski
18
0
0
18 Dec 2023
From Local to Global: Spectral-Inspired Graph Neural Networks
From Local to Global: Spectral-Inspired Graph Neural Networks
Ningyuan Huang
Soledad Villar
Carey E. Priebe
Da Zheng
Cheng-Fu Huang
Lin F. Yang
Vladimir Braverman
23
14
0
24 Sep 2022
Dynamic Network Sampling for Community Detection
Dynamic Network Sampling for Community Detection
Cong Mu
Youngser Park
Carey E. Priebe
27
3
0
29 Aug 2022
Adversarial contamination of networks in the setting of vertex
  nomination: a new trimming method
Adversarial contamination of networks in the setting of vertex nomination: a new trimming method
Sheyda Peyman
M. Tang
V. Lyzinski
AAML
28
0
0
20 Aug 2022
Probability density estimation for sets of large graphs with respect to
  spectral information using stochastic block models
Probability density estimation for sets of large graphs with respect to spectral information using stochastic block models
Daniel Ferguson
Franccois G. Meyer
15
0
0
05 Jul 2022
Perfect Spectral Clustering with Discrete Covariates
Perfect Spectral Clustering with Discrete Covariates
J. Hehir
Xiaoyue Niu
Aleksandra B. Slavkovic
20
0
0
17 May 2022
Spectral embedding for dynamic networks with stability guarantees
Spectral embedding for dynamic networks with stability guarantees
Ian Gallagher
Andrew Jones
Patrick Rubin-Delanchy
26
24
0
02 Jun 2021
Overlapping community detection in networks via sparse spectral
  decomposition
Overlapping community detection in networks via sparse spectral decomposition
Jesús Arroyo
Elizaveta Levina
12
4
0
20 Sep 2020
Bias-Variance Tradeoffs in Joint Spectral Embeddings
Bias-Variance Tradeoffs in Joint Spectral Embeddings
Benjamin Draves
D. Sussman
25
9
0
05 May 2020
Efficient Estimation for Random Dot Product Graphs via a One-step
  Procedure
Efficient Estimation for Random Dot Product Graphs via a One-step Procedure
Fangzheng Xie
Yanxun Xu
27
21
0
10 Oct 2019
Vertex Nomination, Consistent Estimation, and Adversarial Modification
Vertex Nomination, Consistent Estimation, and Adversarial Modification
Joshua Agterberg
Youngser Park
Jonathan Larson
Christopher M. White
Carey E. Priebe
V. Lyzinski
37
16
0
06 May 2019
Statistical inference on random dot product graphs: a survey
Statistical inference on random dot product graphs: a survey
A. Athreya
D. E. Fishkind
Keith D. Levin
V. Lyzinski
Youngser Park
Yichen Qin
D. Sussman
M. Tang
Joshua T. Vogelstein
Carey E. Priebe
22
247
0
16 Sep 2017
Semiparametric spectral modeling of the Drosophila connectome
Semiparametric spectral modeling of the Drosophila connectome
Carey E. Priebe
Youngser Park
M. Tang
A. Athreya
V. Lyzinski
...
Yichen Qin
Benjamin T. Cocanougher
K. Eichler
Marta Zlatic
Albert Cardona
21
28
0
09 May 2017
On the Consistency of the Likelihood Maximization Vertex Nomination
  Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph
  Matching
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching
V. Lyzinski
Keith D. Levin
D. E. Fishkind
Carey E. Priebe
24
19
0
05 Jul 2016
Information Recovery in Shuffled Graphs via Graph Matching
Information Recovery in Shuffled Graphs via Graph Matching
V. Lyzinski
22
32
0
08 May 2016
A nonparametric two-sample hypothesis testing problem for random dot
  product graphs
A nonparametric two-sample hypothesis testing problem for random dot product graphs
M. Tang
A. Athreya
D. Sussman
V. Lyzinski
Carey E. Priebe
35
36
0
08 Sep 2014
Empirical Bayes Estimation for the Stochastic Blockmodel
Empirical Bayes Estimation for the Stochastic Blockmodel
Shakira Suwan
Dominic S. Lee
Runze Tang
D. Sussman
M. Tang
Carey E. Priebe
40
22
0
23 May 2014
Vertex nomination schemes for membership prediction
Vertex nomination schemes for membership prediction
D. E. Fishkind
V. Lyzinski
H. Pao
L. Chen
C. E. Priebe
72
41
0
10 Dec 2013
Spectral Clustering for Divide-and-Conquer Graph Matching
Spectral Clustering for Divide-and-Conquer Graph Matching
V. Lyzinski
D. Sussman
D. E. Fishkind
H. Pao
Li-Wei Chen
Joshua T. Vogelstein
Youngser Park
Carey E. Priebe
44
48
0
04 Oct 2013
A survey of statistical network models
A survey of statistical network models
Anna Goldenberg
A. Zheng
S. Fienberg
E. Airoldi
131
976
0
29 Dec 2009
1