354 citations · 806 across the 36 of their papers we have counts for
45 papers
Optimal Sequential Recommendations: Exploiting User and Item Structure
Mina Karzand, Guy Bresler
We consider an online model for recommendation systems, with each user being recommended an item at each time-step and providing 'like' or 'dislike' feedback. A latent variable mod…
Detection-Recovery and Detection-Refutation Gaps via Reductions from Planted Clique
Guy Bresler, Tianze Jiang
Planted Dense Subgraph (PDS) problem is a prototypical problem with a computational-statistical gap. It also exhibits an intriguing additional phenomenon: different tasks, such as…
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles
Guy Bresler, Chenghao Guo, Yury Polyanskiy
We aim to understand the extent to which the noise distribution in a planted signal-plus-noise problem impacts its computational complexity. To that end, we consider the planted cl…
Random Algebraic Graphs and Their Convergence to Erdos-Renyi
Kiril Bangachev, Guy Bresler
A random algebraic graph is defined by a group with a uniform distribution over it and a connection with expectation satisfying …
Metastable Mixing of Markov Chains: Efficiently Sampling Low Temperature Exponential Random Graphs
Guy Bresler, Dheeraj Nagaraj, Eshaan Nichani
In this paper we consider the problem of sampling from the low-temperature exponential random graph model (ERGM). The usual approach is via Markov chain Monte Carlo, but Bhamidi et…
Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs
Matthew Brennan, Guy Bresler, Brice Huang
In the anisotropic random geometric graph model, vertices correspond to points drawn from a high-dimensional Gaussian distribution and two vertices are connected if their distance…