3 citations · 10 across the 11 of their papers we have counts for
16 papers
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.…
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…
Exact Community Recovery in the Geometric SBM
Julia Gaudio, Xiaochun Niu, Ermin Wei
We study the problem of exact community recovery in the Geometric Stochastic Block Model (GSBM), where each vertex has an unknown community label as well as a known position, gener…
Joint Facility and Demand Location Problem
Ali Kaan Kurbanzade, Julia Gaudio
In typical applications of facility location problems, the location of demand is assumed to be an input to the problem. The demand may be fixed or dynamic, but ultimately outside t…
Average-case and smoothed analysis of graph isomorphism
Julia Gaudio, Miklós Z. Rácz, Anirudh Sridhar
We propose a simple and efficient local algorithm for graph isomorphism which succeeds for a large class of sparse graphs. This algorithm produces a low-depth canonical labeling, w…
The Power of Two Matrices in Spectral Algorithms for Community Recovery
Souvik Dhara, Julia Gaudio, Elchanan Mossel +1
Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the…