Exponential random graph models with soft clique constraints
The episode discusses Yasmin Tousinejad and Vera Koponen's paper, "Exponential Random Graph Models with Soft Clique Constraints." The hosts explain how using soft constraints to penalize cliques helps model real-world networks. The core finding is that the resulting random graph naturally partitions vertices into r-one parts of roughly equal size, regardless of the penalty strength.