Pages that link to "Item:Q288255"
From MaRDI portal
The following pages link to A limit theorem for scaled eigenvectors of random dot product graphs (Q288255):
Displaying 28 items.
- Empirical Bayes estimation for the stochastic blockmodel (Q262706) (← links)
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs (Q1800805) (← links)
- Fusing data depth with complex networks: community detection with prior information (Q2002721) (← links)
- On estimation and inference in latent structure random graphs (Q2038286) (← links)
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849) (← links)
- Community detection on mixture multilayer networks via regularized tensor decomposition (Q2073701) (← links)
- Latent structure blockmodels for Bayesian spectral graph clustering (Q2128055) (← 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)
- Central limit theorems for classical multidimensional scaling (Q2192306) (← links)
- Vertex nomination, consistent estimation, and adversarial modification (Q2199707) (← links)
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels (Q2209705) (← links)
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes (Q2305315) (← links)
- Statistical inference on random dot product graphs: a survey (Q4558565) (← 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)
- Eigenvector delocalization for non‐Hermitian random matrices and applications (Q5120746) (← links)
- (Q5159412) (← links)
- Estimating Mixed Memberships With Sharp Eigenvector Deviations (Q5881973) (← links)
- Robust Recommendation via Social Network Enhanced Matrix Completion (Q6086157) (← links)
- Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals (Q6178566) (← links)
- Spectral analysis of networks with latent space dynamics and signs (Q6541792) (← links)
- Valid two-sample graph testing via optimal transport procrustes and multiscale graph correlation with applications in connectomics (Q6543842) (← links)
- Discussion of “Cocitation and Coauthorship Networks of Statisticians” (Q6620874) (← links)
- Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel (Q6631075) (← links)
- Hypothesis testing for equality of latent positions in random graphs (Q6635733) (← links)