Pages that link to "Item:Q5369834"
From MaRDI portal
The following pages link to Information Limits for Recovering a Hidden Community (Q5369834):
Displaying 9 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Optimal rates for community estimation in the weighted stochastic block model (Q2176614) (← links)
- Community Detection and Stochastic Block Models (Q4558502) (← links)
- Submatrix localization via message passing (Q4558513) (← links)
- Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942) (← links)
- Distribution-Free, Size Adaptive Submatrix Detection with Acceleration (Q5110726) (← links)
- Modeling Network Populations via Graph Distances (Q5881982) (← links)
- A goodness-of-fit test on the number of biclusters in a relational data matrix (Q6058528) (← links)
- The planted matching problem: sharp threshold and infinite-order phase transition (Q6095833) (← links)