Pages that link to "Item:Q4648556"

The following pages link to A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs (Q4648556):

Displaying 42 items.

• Network Cross-Validation for Determining the Number of Communities in Network Data (Q159626) (← links)
• Empirical Bayes estimation for the stochastic blockmodel (Q262706) (← links)
• A limit theorem for scaled eigenvectors of random dot product graphs (Q288255) (← links)
• Impact of regularization on spectral clustering (Q309744) (← links)
• Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
• Large-scale estimation of random graph models with local dependence (Q830532) (← links)
• Vertex nomination schemes for membership prediction (Q902928) (← links)
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs (Q1800805) (← links)
• On estimation and inference in latent structure random graphs (Q2038286) (← links)
• Network representation using graph root distributions (Q2039784) (← links)
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
• On the estimation of latent distances using graph distances (Q2044319) (← links)
• Extended stochastic block models with application to criminal networks (Q2080752) (← links)
• Evidential prototype-based clustering based on transfer learning (Q2105582) (← 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)
• Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
• On Bayesian new edge prediction and anomaly detection in computer networks (Q2291541) (← links)
• Vertex nomination: the canonical sampling and the extended spectral nomination schemes (Q2305315) (← links)
• The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics (Q2328047) (← links)
• Consistency of spectral clustering in stochastic block models (Q2338925) (← links)
• Role of normalization in spectral clustering for stochastic blockmodels (Q2352733) (← links)
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734) (← links)
• Statistical inference on random dot product graphs: a survey (Q4558565) (← links)
• A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection (Q4685333) (← links)
• (Q4969121) (← links)
• Vertex nomination via seeded graph matching (Q4970326) (← links)
• (Q4998971) (← links)
• (Q5053174) (← links)
• (Q5054582) (← links)
• Testing for Equivalence of Network Distribution Using Subgraph Counts (Q5065993) (← links)
• Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering (Q5066394) (← links)
• (Q5149219) (← links)
• (Q5159412) (← links)
• (Q5159466) (← links)
• (Q5381123) (← links)
• Robust Recommendation via Social Network Enhanced Matrix Completion (Q6086157) (← links)
• Lead-lag detection and network clustering for multivariate time series with an application to the us equity market (Q6097122) (← 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)