Pages that link to "Item:Q1800805"

The following pages link to Limit theorems for eigenvectors of the normalized Laplacian for random graphs (Q1800805):

Displaying 16 items.

• Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model (Q2136643) (← links)
• Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator (Q2137006) (← links)
• Spectral graph clustering via the expectation-solution algorithm (Q2154947) (← links)
• The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain (Q2185750) (← links)
• Bayesian estimation of the latent dimension and communities in stochastic blockmodels (Q2209705) (← links)
• Normal approximation and confidence region of singular subspaces (Q2233555) (← links)
• The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics (Q2328047) (← links)
• Statistical inference on random dot product graphs: a survey (Q4558565) (← links)
• Detecting Overlapping Communities in Networks Using Spectral Methods (Q5027027) (← links)
• Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming (Q5043284) (← links)
• (Q5053174) (← links)
• Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering (Q5066394) (← links)
• Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes (Q5885123) (← links)
• Robust Recommendation via Social Network Enhanced Matrix Completion (Q6086157) (← links)
• Euclidean Representation of Low-Rank Matrices and Its Geometric Properties (Q6166054) (← links)
• Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals (Q6178566) (← links)