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
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivPerturbation-Based Data Selection for Medical Question Answering1harxivAdaptive Transfer of Representational Signatures for LLM Reliability Detection1harxivPropasafe-Hybrid: A Text-Based Hybrid Propaganda Detection Tool1harxivIncremental Predictive Value of LLM Tutoring Interactions for Student Performance1hThe Bubble Brief
MON · WED · FRIRead graph-inference insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗