Tree Recursion hardcore model: Prlv is occupied R=1-Prv is occupied independent set in G d (I)xλI 爬中 i三1 Prv is occupied] Pr[v2 is occupied o] Prvs is occupiedo] =1-Prvt is occupied R=1-Pri2 is occupied可 fs=1-Prv is occupied可 occupied ☑：unoccupiedR￾ 3 = Pr[v3 is occupied | ￾] 1 ￾ Pr[v3 is occupied | ￾] R￾ 2 = Pr[v2 is occupied | ￾] 1 ￾ Pr[v2 is occupied | ￾] R￾ 1 = Pr[v1 is occupied | ￾] 1 ￾ Pr[v1 is occupied | ￾] R￾ v = Pr[v is occupied | ￾] 1 ￾ Pr[v is occupied | ￾] R￾ v = ￾ Y d i=1 1 1 + R￾ i v v v Tree Recursion µ(I) / ￾|I| hardcore model: independent set I in G v v1 v2 v3 : occupied : unoccupied