Pages that link to "Item:Q651016"

The following pages link to Spectral clustering and the high-dimensional stochastic blockmodel (Q651016):

Displaying 50 items.

• On Bayesian new edge prediction and anomaly detection in computer networks (Q2291541) (← links)
• Profile likelihood biclustering (Q2293724) (← links)
• Consistent structure estimation of exponential-family random graph models with block structure (Q2295031) (← links)
• Detecting structural changes in longitudinal network data (Q2297236) (← links)
• Vertex nomination: the canonical sampling and the extended spectral nomination schemes (Q2305315) (← links)
• Exact recovery in the Ising blockmodel (Q2313270) (← links)
• Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284) (← links)
• The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics (Q2328047) (← links)
• Numerical study of reciprocal recommendation with domain matching (Q2329881) (← links)
• Matrix estimation by universal singular value thresholding (Q2338924) (← links)
• Consistency of spectral clustering in stochastic block models (Q2338925) (← links)
• The topology of probability distributions on manifolds (Q2343028) (← links)
• Convergence of the groups posterior distribution in latent or stochastic block models (Q2345132) (← links)
• Differential calculus on graphon space (Q2347882) (← 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)
• Nonparametric statistics of dynamic networks with distinguishable nodes (Q2404165) (← links)
• Convexified modularity maximization for degree-corrected stochastic block models (Q2413602) (← links)
• Co-clustering separately exchangeable network data (Q2448722) (← links)
• Random matrix theory in statistics: a review (Q2453609) (← links)
• Higher-order spectral clustering for geometric graphs (Q2658739) (← links)
• An alternative class of models to position social network groups in latent spaces (Q2673834) (← links)
• Localization of dominant eigenpairs and planted communities by means of Frobenius inner products (Q2828822) (← links)
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph (Q2833535) (← links)
• Spectral clustering and biclustering. Learning large graphs and contingency tables (Q2844997) (← links)
• Stochastic blockmodels with a growing number of classes (Q2892086) (← links)
• Perturbation of Linear Forms of Singular Vectors Under Gaussian Noise (Q2954054) (← links)
• Spectral redemption in clustering sparse networks (Q2962184) (← links)
• The highest dimensional stochastic blockmodel with a regularized estimator (Q3195174) (← links)
• Multiresolution Network Models (Q3391195) (← links)
• Node Features Adjusted Stochastic Block Model (Q3391243) (← links)
• Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication (Q3391269) (← links)
• An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation (Q4558538) (← links)
• Sparse exchangeable graphs and their limits via graphon processes (Q4558542) (← links)
• Statistical inference on random dot product graphs: a survey (Q4558565) (← links)
• Asymptotic mutual information for the balanced binary stochastic block model (Q4603702) (← links)
• Sparse Graphs Using Exchangeable Random Measures (Q4603788) (← links)
• Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040) (← links)
• (Q4633045) (← links)
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting (Q4633061) (← links)
• Near-Optimal Bounds for Phase Synchronization (Q4637501) (← links)
• A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection (Q4685333) (← links)
• On the Stability of Network Indices Defined by Means of Matrix Functions (Q4689241) (← links)
• (Q4969035) (← links)
• Optimal Bipartite Network Clustering (Q4969080) (← links)
• (Q4969113) (← links)
• (Q4969176) (← links)
• Confidence sets for network structure (Q4969798) (← links)
• Review of statistical network analysis: models, algorithms, and software (Q4969842) (← links)
• Vertex nomination via seeded graph matching (Q4970326) (← links)