Pages that link to "Item:Q287720"

The following pages link to Consistency thresholds for the planted bisection model (Q287720):

Displaying 37 items.

• Rate-optimal graphon estimation (Q159635) (← links)
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding (Q485940) (← links)
• Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Contiguity and non-reconstruction results for planted partition models: the dense case (Q1748922) (← 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)
• 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)
• Community detection with dependent connectivity (Q2054505) (← links)
• Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
• Global and individualized community detection in inhomogeneous multilayer networks (Q2105190) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• Uniform estimation in stochastic block models is slow (Q2137819) (← links)
• Community detection with a subsampled semidefinite program (Q2143169) (← 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)
• Rate optimal Chernoff bound and application to community detection in the stochastic block models (Q2180063) (← links)
• Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
• Maximum likelihood estimation of sparse networks with missing observations (Q2242863) (← links)
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm (Q2310389) (← links)
• Frequentist validity of Bayesian limits (Q2656593) (← links)
• Spectral norm bounds for block Markov chain random matrices (Q2689895) (← links)
• (Q2941490) (redirect page) (← links)
• Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log^*|<i>V</i>|) time (Q4684942) (← links)
• Recovering Structured Probability Matrices (Q4993314) (← links)
• The Lov\'asz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime (Q5002631) (← links)
• Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
• (Q5111755) (← links)
• Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
• A spectral method for community detection in moderately sparse degree-corrected stochastic block models (Q5233186) (← links)
• (Q5875512) (← links)
• Mutual information for the sparse stochastic block model (Q6151948) (← links)
• Asymptotic uncertainty quantification for communities in sparse planted bi-section models (Q6172088) (← links)