Scale-free percolation mixing time

Assign to each vertex of the one-dimensional torus i.i.d. weights with a heavy-tail of index τ−1>0. Connect then each couple of vertices with probability roughly proportional to the product of their weights and that decays polynomially with exponent α>0 in their distance. The resulting graph is called scale-free percolation. The goal of...