activity
20072025
most citedThe Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels

354 citations · 806 across the 36 of their papers we have counts for

collaborators
Showing math.PRShow all

7 papers · 1 filter

math.PR2023

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…

math.PR2023★ 2 cited

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 …

math.PR2022

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…

math.PR2021★ 7 cited

De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions

Matthew Brennan, Guy Bresler, Brice Huang

A recent line of work has studied the relationship between the Wishart matrix , where has i.i.d. standard Gaussian entries, and the correspo…

math.PR2019

Phase Transitions for Detecting Latent Geometry in Random Graphs

Matthew Brennan, Guy Bresler, Dheeraj Nagaraj

Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These g…

math.PR2017

Stein's Method for Stationary Distributions of Markov Chains and Application to Ising Models

Guy Bresler, Dheeraj M. Nagaraj

We develop a new technique, based on Stein's method, for comparing two stationary distributions of irreducible Markov Chains whose update rules are `close enough'. We apply this te…