Search Results for author:
Found 2 papers, 1 papers with code
Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
The second contribution is a simultaneous model selection framework.
A central limit theorem for scaled eigenvectors of random dot product graphs
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
