The Small Word Phenomenon An Algorithmic Perspective小世界现象，算法的角度.pptVIP

The Small World Phenomenon: An Algorithmic Perspective;Oh, it’s such a small world!!;Small world! Small world!;Small Worlds Everywhere;Two Important Properties of Small World Networks;Enter Kleinberg…;Bounds on Kleinberg’s Model;For r=2, p=1, q=1. Event Eu(v) - u chooses v as its random long range contact Prob[Eu(v)] = ?Prob[Eu(v)] ≤ [4 ln(6n) d(u,v)2]-1. In phase j, 2j d(u,t) ≤ 2j+1. For log(log n) j log n, No. of nodes in Bj ≥ each within lattice distance 2j + 2j+1 2j+2 of u Prob[Enters Bj] ≥ Steps in j = Xj; ?;Proof of lower bound 1;Proof of lower bound 1 contd.;Proof of lower