Random Walks with Lookahead on Power Law Random Graphs

We show that in power law random graphs, almost surely, the expected rate at which a random walk with lookahead discovers the nodes of the graph is sublinear.

[1]  J. Spencer.  Ten lectures on the probabilistic method , 1987 .

[2]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[3]  Joel Spencer.  Ten Lectures on the Probabilistic Method: Second Edition , 1994 .

[4]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[5]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[7]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[8]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[9]  Alan M. Frieze,et al.  Crawling on web graphs , 2002, STOC '02.

[10]  Alan M. Frieze,et al.  Crawling on Simple Models of Web Graphs , 2004, Internet Math..

[11]  Christos Gkantsidis,et al.  Conductance and congestion in power law graphs , 2003, SIGMETRICS '03.

[12]  Alan M. Frieze,et al.  The cover time of sparse random graphs. , 2003, SODA '03.

[13]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[14]  Moni Naor,et al.  Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.

[15]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[16]  Alan M. Frieze,et al.  The Cover Time of Random Regular Graphs , 2005, SIAM J. Discret. Math..

[17]  Alan M. Frieze,et al.  The cover time of the preferential attachment graph , 2007, J. Comb. Theory, Ser. B.