Pages that link to "Item:Q2338925"
From MaRDI portal
The following pages link to Consistency of spectral clustering in stochastic block models (Q2338925):
Displayed 50 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Network Cross-Validation for Determining the Number of Communities in Network Data (Q159626) (← links)
- Rate-optimal graphon estimation (Q159635) (← links)
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
- Spectral clustering in the dynamic stochastic block model (Q668613) (← links)
- Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
- A Schatten-\(q\) low-rank matrix perturbation analysis via perturbation projection error bound (Q821008) (← links)
- Community detection via an efficient nonconvex optimization approach based on modularity (Q830497) (← links)
- Large-scale estimation of random graph models with local dependence (Q830532) (← links)
- An impossibility result for reconstruction in the degree-corrected stochastic block model (Q1617152) (← links)
- Bayesian community detection (Q1631576) (← links)
- Community detection by \(L_{0}\)-penalized graph Laplacian (Q1639201) (← links)
- Clustering sparse binary data with hierarchical Bayesian Bernoulli mixture model (Q1662817) (← links)
- A spectral algorithm with additive clustering for the recovery of overlapping communities in networks (Q1663638) (← links)
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
- On semidefinite relaxations for the block model (Q1747735) (← links)
- Community detection in degree-corrected block models (Q1800797) (← links)
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs (Q1800805) (← links)
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model (Q2008607) (← links)
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283) (← 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)
- Sparse random tensors: concentration, regularization and applications (Q2044387) (← links)
- Convex programming based spectral clustering (Q2051294) (← links)
- Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
- Optimality of spectral clustering in the Gaussian mixture model (Q2054516) (← links)
- Community detection on mixture multilayer networks via regularized tensor decomposition (Q2073701) (← links)
- Extended stochastic block models with application to criminal networks (Q2080752) (← links)
- Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
- Overlapping community detection in networks via sparse spectral decomposition (Q2121698) (← links)
- The hierarchy of block models (Q2121701) (← links)
- The Bethe Hessian and information theoretic approaches for online change-point detection in network data (Q2121711) (← 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)
- Uniform estimation in stochastic block models is slow (Q2137819) (← links)
- Hypothesis testing in sparse weighted stochastic block model (Q2165832) (← links)
- Model assisted variable clustering: minimax-optimal recovery and algorithms (Q2176610) (← links)
- Optimal rates for community estimation in the weighted stochastic block model (Q2176614) (← links)
- Spectral and matrix factorization methods for consistent community detection in multi-layer networks (Q2176617) (← links)
- Rate optimal Chernoff bound and application to community detection in the stochastic block models (Q2180063) (← links)
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) (← links)
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging (Q2194484) (← links)
- Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels (Q2209705) (← links)
- A similarity measure for second order properties of non-stationary functional time series with applications to clustering and testing (Q2214256) (← links)
- Theoretical and computational guarantees of mean field variational inference for community detection (Q2215750) (← links)
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios (Q2225321) (← links)
- Profile likelihood biclustering (Q2293724) (← links)
- Consistent structure estimation of exponential-family random graph models with block structure (Q2295031) (← links)
- Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)