Pages that link to "Item:Q2976866"

The following pages link to Achieving Exact Cluster Recovery Threshold via Semidefinite Programming (Q2976866):

Displaying 42 items.

• On semidefinite relaxations for the block model (Q1747735) (← links)
• Random Laplacian matrices and convex relaxations (Q1750385) (← links)
• Community detection in degree-corrected block models (Q1800797) (← links)
• Clustering in block Markov chains (Q1996780) (← links)
• Convex relaxation methods for community detection (Q2038282) (← links)
• Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283) (← links)
• On the estimation of latent distances using graph distances (Q2044319) (← links)
• Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
• Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator (Q2137006) (← links)
• Local law and Tracy-Widom limit for sparse stochastic block models (Q2175009) (← links)
• Optimal rates for community estimation in the weighted stochastic block model (Q2176614) (← links)
• Rate optimal Chernoff bound and application to community detection in the stochastic block models (Q2180063) (← links)
• Exact recovery in the Ising blockmodel (Q2313270) (← links)
• Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
• Convexified modularity maximization for degree-corrected stochastic block models (Q2413602) (← links)
• Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks (Q2658079) (← links)
• Spectral norm bounds for block Markov chain random matrices (Q2689895) (← links)
• Community Detection and Stochastic Block Models (Q4558502) (← links)
• Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log^*|<i>V</i>|) time (Q4684942) (← links)
• (Q4969035) (← links)
• Optimal Bipartite Network Clustering (Q4969080) (← links)
• (Q4999091) (← links)
• Covariate Regularized Community Detection in Sparse Graphs (Q4999151) (← links)
• The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
• Community Detection in Sparse Networks Using the Symmetrized Laplacian Inverse Matrix (SLIM) (Q5037811) (← links)
• (Q5053241) (← links)
• The Ratio-Cut Polytope and K-Means Clustering (Q5062119) (← links)
• Joint Community Detection and Rotational Synchronization via Semidefinite Programming (Q5097498) (← links)
• (Q5111755) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
• The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5232321) (← links)
• Joint Alignment from Pairwise Differences with a Noisy Oracle (Q5881228) (← links)
• \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
• Efficient joint object matching via linear programming (Q6052052) (← links)
• Community detection in the sparse hypergraph stochastic block model (Q6074664) (← links)
• A unified approach to synchronization problems over subgroups of the orthogonal group (Q6117023) (← 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)
• Community Detection in Censored Hypergraph (Q6185140) (← links)