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. 1607.08601
  4. Cited By
Limit theorems for eigenvectors of the normalized Laplacian for random
  graphs

Limit theorems for eigenvectors of the normalized Laplacian for random graphs

28 July 2016
M. Tang
Carey E. Priebe
ArXivPDFHTML

Papers citing "Limit theorems for eigenvectors of the normalized Laplacian for random graphs"

7 / 7 papers shown
Title
Role of normalization in spectral clustering for stochastic blockmodels
Role of normalization in spectral clustering for stochastic blockmodels
Purnamrita Sarkar
Peter J. Bickel
62
98
0
05 Oct 2013
Nonparametric graphon estimation
Nonparametric graphon estimation
P. Wolfe
S. Olhede
85
202
0
23 Sep 2013
Regularized Spectral Clustering under the Degree-Corrected Stochastic
  Blockmodel
Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel
Tai Qin
Karl Rohe
63
303
0
16 Sep 2013
Pseudo-likelihood methods for community detection in large sparse
  networks
Pseudo-likelihood methods for community detection in large sparse networks
Arash A. Amini
Aiyou Chen
Peter J. Bickel
Elizaveta Levina
143
407
0
10 Jul 2012
A consistent adjacency spectral embedding for stochastic blockmodel
  graphs
A consistent adjacency spectral embedding for stochastic blockmodel graphs
D. Sussman
M. Tang
D. E. Fishkind
Carey E. Priebe
102
291
0
10 Aug 2011
Spectral clustering and the high-dimensional stochastic blockmodel
Spectral clustering and the high-dimensional stochastic blockmodel
Karl Rohe
S. Chatterjee
Bin Yu
186
931
0
09 Jul 2010
A Tutorial on Spectral Clustering
A Tutorial on Spectral Clustering
U. V. Luxburg
195
10,497
0
01 Nov 2007
1