Pages that link to "Item:Q1747735"

The following pages link to On semidefinite relaxations for the block model (Q1747735):

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)
• Community detection via an efficient nonconvex optimization approach based on modularity (Q830497) (← links)
• A review of dynamic network models with latent variables (Q1670776) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Fluctuations for block spin Ising models (Q1800846) (← links)
• Fluctuation results for general block spin Ising models (Q1984820) (← links)
• Convex relaxation methods for community detection (Q2038282) (← 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)
• Phases of small worlds: a mean field formulation (Q2087733) (← links)
• Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
• Overlapping community detection in networks via sparse spectral decomposition (Q2121698) (← links)
• A likelihood-ratio type test for stochastic block models with bounded degrees (Q2123258) (← links)
• A review on spectral clustering and stochastic block models (Q2132025) (← links)
• Multi-group binary choice with social interaction and a random communication structure -- a random graph approach (Q2139925) (← 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)
• Exact recovery in block spin Ising models at the critical line (Q2180078) (← links)
• Spectral clustering-based community detection using graph distance and node attributes (Q2184394) (← links)
• Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering (Q2189394) (← links)
• Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
• Measuring the stability of spectral clustering (Q2228130) (← links)
• Maximum likelihood estimation of sparse networks with missing observations (Q2242863) (← links)
• When do birds of a feather flock together? \(k\)-means, proximity, and conic programming (Q2288194) (← links)
• Profile likelihood biclustering (Q2293724) (← links)
• Dynamic network models and graphon estimation (Q2313290) (← links)
• Partial recovery bounds for clustering with the relaxed \(K\)-means (Q2319817) (← links)
• Universal inference (Q5073098) (← links)
• Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model (Q5868965) (← links)
• \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
• Subsampling spectral clustering for stochastic block models in large-scale networks (Q6071693) (← 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)