

























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 this work is to study the mixing time of the simple random walk on this structure. We depict a rich phase diagram in $α$ and $τ$. In particular we prove that the presence of hubs can speed up the mixing of the chain. We use different techniques for each phase, the most interesting of which is a bootstrap procedure to reduce the model from a phase where the degrees have bounded averages to a setting with unbounded averages.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。