作者: Don Coppersmith , David Gamarnik , Maxim Sviridenko
DOI: 10.1002/RSA.10042
关键词:
摘要: We consider the following long-range percolation model: an undirected graph with node set {0, 1, ..., N}d, has edges (x, y) selected probability ≈ β/||x -y||s if ||x - y|| ' η1 > η2 it is at most Nη2 when s = 2d, and least Nη1 d 2, β 1 or 2d. also provide a simple proof that diameter log O(1) N high probability, established previously in [2].