Pages that link to "Item:Q1800805"

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

Displaying 31 items.

• A limit theorem for scaled eigenvectors of random dot product graphs (Q288255) (← links)
• Convergence of the density of states and delocalization of eigenvectors on random regular graphs (Q906575) (← links)
• Triangulated Laman graphs, local stochastic matrices, and limits of their products (Q2020665) (← links)
• Eigenvalues of stochastic blockmodel graphs and random graphs with low-rank edge probability matrices (Q2121699) (← links)
• 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)
• (Q4524432) (← 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)
• Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs (Q5246575) (← links)
• On the eigenspaces of lamplighter random walks and percolation clusters on graphs (Q5322857) (← links)
• Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes (Q5885123) (← links)
• Robust Recommendation via Social Network Enhanced Matrix Completion (Q6086157) (← links)
• Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure (Q6107237) (← 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)
• Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates (Q6190747) (← links)
• Testing Simultaneous Diagonalizability (Q6567946) (← links)
• Discussion of “Cocitation and Coauthorship Networks of Statisticians” (Q6620874) (← links)
• Rejoinder: “Co-citation and Co-authorship Networks of Statisticians” (Q6620879) (← links)
• Spectral Clustering on Spherical Coordinates Under the Degree-Corrected Stochastic Blockmodel (Q6631075) (← links)
• Spectral Embedding of Weighted Graphs (Q6631693) (← links)
• Hypothesis testing for equality of latent positions in random graphs (Q6635733) (← links)