activity
20112026
most citedCommunity detection in general stochastic block models: fundamental limits and efficient recovery algorithms

65 citations · 143 across the 21 of their papers we have counts for

collaborators
Showing 2025Show all

3 papers · 1 filter

math.ST2025

Finding Planted Cycles in a Random Graph

Julia Gaudio, Colin Sandon, Jiaming Xu +1

In this paper, we study the problem of finding a collection of planted cycles in an \ER random graph , in analogy to the famous Planted Clique Problem.…

cs.IT2025

Reed-Muller Codes for Quantum Pauli and Multiple Access Channels

Dina Abdelhadi, Colin Sandon, Emmanuel Abbe +1

Reed-Muller (RM) codes have undergone significant analytical advancements over the past decade, particularly for binary memoryless symmetric (BMS) channels. We extend the scope of…

math.PR2025

Phase Transitions in Planted k-Factor Recovery

Julia Gaudio, Colin Sandon, Jiaming Xu +1

This paper studies the problem of inferring a -factor, specifically a spanning -regular graph, planted within an Erdos-Renyi random graph . We show that as the aver…