4 citations · 7 across the 9 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.PR2017
Decomposition of mean-field Gibbs distributions into product measures
Ronen Eldan, Renan Gross
We show that under a low complexity condition on the gradient of a Hamiltonian, Gibbs distributions on the Boolean hypercube are approximate mixtures of product measures whose prob…
math.PR2017
Exponential random graphs behave like mixtures of stochastic block models
Ronen Eldan, Renan Gross
We study the behavior of exponential random graphs in both the sparse and the dense regime. We show that exponential random graphs are approximate mixtures of graphs with independe…
math.CO2017★ 4 cited
Indistinguishable sceneries on the Boolean hypercube
Renan Gross, Uri Grupel
We show that the scenery reconstruction problem on the Boolean hypercube is in general impossible. This is done by using locally biased functions, in which every vertex has a const…