加载中…
We consider long-range percolation (LRP) on with connection probabilities for and . Our main result is that the mixing time of the random walk on the giant component of supercritical LRP inside a box of side length is of order . To establish the upper bound, we show that a -dimensional isoperimetric inequality holds almost surely simultaneously for all connected sets inside the giant component that are large enough.

生成讲解博客的中文版本

生成AI智能校验的中文版本