Pages that link to "Item:Q4684942"
From MaRDI portal
The following pages link to Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log<sup>*</sup>|<i>V</i>|) time (Q4684942):
Displaying 11 items.
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- Belief propagation, robust reconstruction and optimal recovery of block models (Q341611) (← links)
- Finding one community in a sparse graph (Q892403) (← links)
- On the computational tractability of statistical estimation on amenable graphs (Q2067660) (← links)
- Non-convex exact community recovery in stochastic block model (Q2089764) (← links)
- Exact recovery of community detection in \(k\)-partite graph models with applications to learning electric potentials in electric networks (Q2658079) (← links)
- Algorithm independent bounds on community detection problems and associated transitions in stochastic block model graphs (Q4689361) (← links)
- Test dense subgraphs in sparse uniform hypergraph (Q5079097) (← links)
- How robust are reconstruction thresholds for community detection? (Q5361883) (← links)
- Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)
- Community Detection in Censored Hypergraph (Q6185140) (← links)
