A new planted ranked subgraph model in directed graphs is analyzed, with exact statistical and computational thresholds for detection and recovery in the log-density and extreme regimes.
Detecting high log-densities: an o (n 1/4 ) approximation for densest k-subgraph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Statistical inference of a ranked community in a directed graph
A new planted ranked subgraph model in directed graphs is analyzed, with exact statistical and computational thresholds for detection and recovery in the log-density and extreme regimes.