Pages that link to "Item:Q737326"

The following pages link to Community detection in sparse networks via Grothendieck's inequality (Q737326):

Displaying 34 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
• Information-theoretic thresholds from the cavity method (Q1649349) (← links)
• A review of dynamic network models with latent variables (Q1670776) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Convex relaxation methods for community detection (Q2038282) (← links)
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
• The large deviation principle for interacting dynamical systems on random graphs (Q2113491) (← links)
• Long time dynamics for interacting oscillators on graphs (Q2117446) (← links)
• Edgeworth expansions for network moments (Q2131253) (← links)
• Local law and Tracy-Widom limit for sparse stochastic block models (Q2175009) (← links)
• Model assisted variable clustering: minimax-optimal recovery and algorithms (Q2176610) (← links)
• Rate optimal Chernoff bound and application to community detection in the stochastic block models (Q2180063) (← links)
• Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
• Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
• Theoretical and computational guarantees of mean field variational inference for community detection (Q2215750) (← links)
• Embedding-based silhouette community detection (Q2217405) (← links)
• Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures (Q2243168) (← links)
• Profile likelihood biclustering (Q2293724) (← links)
• Optimal graphon estimation in cut distance (Q2312687) (← links)
• Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)
• Interacting diffusions on random graphs with diverging average degrees: hydrodynamics and large deviations (Q2328693) (← links)
• Convexified modularity maximization for degree-corrected stochastic block models (Q2413602) (← links)
• Phase transitions in semidefinite relaxations (Q2962328) (← links)
• Clustering subgaussian mixtures by semidefinite programming (Q4603713) (← links)
• Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
• Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
• Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising (Q6059433) (← links)
• Community detection in the sparse hypergraph stochastic block model (Q6074664) (← links)
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
• A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization (Q6166053) (← links)
• Asymptotic uncertainty quantification for communities in sparse planted bi-section models (Q6172088) (← links)
• Central limit theorems for global and local empirical measures of diffusions on Erdős-Rényi graphs (Q6177575) (← links)
• Clustering heterogeneous financial networks (Q6196293) (← links)