Showing that limits of combinatorial statistics of random graphs exist
Speaker: JuspreetTitle: Showing that limits of combinatorial statistics of random graphs exist
Date: 11 Mar 2022 12:00-13:00 EST
Location: SEC Level 3 NW Terrace
Food: Dry pot
Abstract: Recently, an algorithm that gives a (near) PTAS for the MAX-CUT problem over Random D-Regular Graphs was proposed, assuming a widely believed conjecture. The algorithm relies on the development of a number of deep ideas, but one critical idea is that the limiting value of the MAX-CUT of Random D-Regular Graphs can be expressed as a function of the (normalized) MAX-CUT value on another (dense) family of graphs. In this talk, we will use an elementary interpolation technique to show that the limiting cut value on this specific dense family of graphs exists.