Exponential random graph models with soft clique constraints

Yasmin Tousinejad, Vera Koponen

Let $r\ge 3$ be fixed, and let ${\mathbf{G}}_n$ be the set of all simple graphs with vertex set $[n]=\{1,\dots ,n\}$. We consider an exponential random graph model which gives higher…