Pages that link to "Item:Q2352734"

The following pages link to Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734):

Displaying 18 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Rate-optimal graphon estimation (Q159635) (← links)
• Community detection by \(L_{0}\)-penalized graph Laplacian (Q1639201) (← links)
• On semidefinite relaxations for the block model (Q1747735) (← links)
• Fusing data depth with complex networks: community detection with prior information (Q2002721) (← 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)
• Edgeworth expansions for network moments (Q2131253) (← links)
• All-in-one robust estimator of the Gaussian mean (Q2131271) (← links)
• Spectral clustering-based community detection using graph distance and node attributes (Q2184394) (← links)
• Vertex nomination, consistent estimation, and adversarial modification (Q2199707) (← links)
• Outlier detection in networks with missing links (Q2242182) (← links)
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734) (← links)
• Convexified modularity maximization for degree-corrected stochastic block models (Q2413602) (← links)
• Large volatility matrix analysis using global and national factor models (Q6108334) (← links)
• Estimating mixed-memberships using the symmetric Laplacian inverse matrix (Q6158365) (← links)
• Clustering heterogeneous financial networks (Q6196293) (← links)