We show that the largest density of factor of i.i.d. independent sets in the d-regular tree is asymptotically at most (logd)/d as d → ∞. This matches the lower bound given by previous constructions.

Forbes contributors publish independent expert analyses and insights. Roger Valdez writes about housing economics and policy. It is an irony almost never noted that tenant advocates who support rent ...