scientific article; zbMATH DE number 7626709

MaRDI QIDQ5053174zbMATH OpenFDO

Authors Keith Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe

Publication date 6 December 2022

Full work available at URL https://arxiv.org/abs/1910.00423, https://jmlr.csail.mit.edu/papers/v22/19-852.html

zbMATH Keywords

adjacency matrixgraph Laplacianout-of-sample extensionrandom dot product graphspectral embedding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Spectral convergence of the connection Laplacian from random samples
• Spectral convergence of graph Laplacian and heat kernel reconstruction in L^ from random samples
• Convergence of Laplacian spectra from random samples
• Spectral distributions of adjacency and Laplacian matrices of random graphs
• Scaling limit of the spectral distributions of the Laplacians on large graphs
• A limit theorem for scaled eigenvectors of random dot product graphs
• Empirical distributions of Laplacian matrices of large dilute random graphs
• Central Limit Theorems and Asymptotic Spectral Analysis on Large Graphs
• Limiting spectral distribution for large sample covariance matrices with graph-dependent elements

Cites work

• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• A limit theorem for scaled eigenvectors of random dot product graphs
• A useful variant of the Davis-Kahan theorem for statisticians
• An introduction to matrix concentration inequalities
• Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
• Automatic dimensionality selection from the scree plot via the use of profile likelihood
• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Concentration inequalities. A nonasymptotic theory of independence
• Diffusion maps
• Distributed estimation of principal eigenspaces
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 7625156 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Latent Space Approaches to Social Network Analysis
• Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• Modern multidimensional scaling. Theory and applications.
• Multidimensional scaling. I: Theory and method
• Optimal Bayesian estimation for random dot product graphs
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
• Procrustes Problems
• Random Dot Product Graph Models for Social Networks
• Statistical inference on random dot product graphs: a survey
• The out-of-sample problem for classical multidimensional scaling
• Universally consistent vertex classification for latent positions graphs

Cited in

(2)

• Randomized Spectral Clustering in Large-Scale Stochastic Block Models
• Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5053174)