arxiv
PublishedJune 18, 2026 at 4:00 AM
—neutral
Robust Detection of Planted Subgraphs in Semi-Random Models
Publisher summary· verbatim
arXiv:2508.02158v2 Announce Type: replace-cross Abstract: Detection of planted subgraphs in Erd\"os-R\'enyi random graphs has been extensively studied, leading to a rich body of results characterizing both statistical and computational thresholds. However, most prior work assumes a purely random gen
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivReverso: Efficient Time Series Foundation Models for Zero-shot Forecasting5harxivMultinex: Lightweight Low-light Image Enhancement via Multi-prior Retinex5harxivMarket Design for AI: Beyond the Copyright Binary5harxivWho Pays the Price? Stakeholder-Centric Prompt Injection Benchmarking for Real-world Web Agents5hThe Bubble Brief
WEEKLYRead graph-inference insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗