On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model
Probability
2020-09-04 v3 Combinatorics
Abstract
We establish a strict asymptotic inequality between a class of graph partition problems on the sparse End\H{o]s-R\'enyi and random regular graph ensembles with the same average degree. Along the way, we establish a variational representation for the ground state energy for generalized mixed -spin glasses and derive strict comparison inequalities for such models as the alphabet changes.
Keywords
Cite
@article{arxiv.1707.09042,
title = {On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model},
author = {Aukosh Jagannath and Subhabrata Sen},
journal= {arXiv preprint arXiv:1707.09042},
year = {2020}
}