Computational Phase Transition Sampling almost-uniform independent set in graphs with maximum degree△： ●[Weitz2006]:lf△≤5，poly-time. [Sly 2010]:If A=6,no poly-time algorithm unless NP=RP. A phase transition occurs when△：5→6. Local Computation?Computational Phase Transition • [Weitz 2006]: If ∆≤5, poly-time. • [Sly 2010]: If ∆≥6, no poly-time algorithm unless NP=RP. Sampling almost-uniform independent set in graphs with maximum degree ∆: A phase transition occurs when ∆: 5→6. Local Computation?