A model of self‐avoiding random walks for searching complex networks
暂无分享,去创建一个
Antonio Fernández | Luis López | Vicent Cholvi | Víctor López Millán | Antonio Fernández | V. Cholvi | V. Millán | Luis López
[1] Mohammed Abdullah,et al. The Cover Time of Random Walks on Graphs , 2012, ArXiv.
[2] P. Imkeller,et al. The parabolic Anderson model with heavy-tailed potential , 2011 .
[3] Gordon Slade,et al. The self-avoiding walk: A brief survey , 2011 .
[4] Antonio Fernández,et al. Performance of random walks in one-hop replication networks , 2009, Comput. Networks.
[5] Takis Konstantopoulos,et al. MARKOV CHAINS AND RANDOM WALKS , 2009 .
[6] César A. Hidalgo,et al. Scale-free networks , 2008, Scholarpedia.
[7] Gwillerm Froc,et al. Random walk based routing protocol for wireless sensor networks , 2007, ValueTools '07.
[8] A. Flammini,et al. Random Walks on Directed Networks: the Case of PageRank , 2006, Int. J. Bifurc. Chaos.
[9] L. D. Costa,et al. Exploring complex networks through random walks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[10] V. M. Kenkre,et al. Transport Properties of Random Walks on Scale-Free/Regular-Lattice Hybrid Networks , 2006, cond-mat/0608619.
[11] Duncan J. Watts,et al. The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .
[12] Christos Gkantsidis,et al. Random walks in peer-to-peer networks: Algorithms and evaluation , 2006, Perform. Evaluation.
[13] Hawoong Jeong,et al. Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.
[14] Jennifer L. Welch,et al. Random walk for self-stabilizing group communication in ad hoc networks , 2002, IEEE Transactions on Mobile Computing.
[15] Mark E. J. Newman,et al. Structure and Dynamics of Networks , 2009 .
[16] Venkatesh Saligrama,et al. A Random-Walk Model for Distributed Computation in Energy-Limited Networks , 2006 .
[17] A. Abouzeid,et al. Modeling and analysis of random walk search algorithms in P2P networks , 2005, Second International Workshop on Hot Topics in Peer-to-Peer Systems.
[18] C. Herrero. Self-avoiding walks on scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[19] Shichao Yang. Exploring complex networks by walking on them. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[20] Ahmed Helmy,et al. Active query forwarding in sensor networks , 2005, Ad Hoc Networks.
[21] Pascal Felber,et al. Efficient search in unstructured peer-to-peer networks , 2004, SPAA '04.
[22] Moni Naor,et al. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.
[23] V. Roychowdhury,et al. Scale-free and stable structures in complex ad hoc networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.
[24] Scott Shenker,et al. Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.
[25] Kai-Yeung Siu,et al. Distributed construction of random expander networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[26] K. Li,et al. Search and replication in unstructured peer-to-peer networks , 2002 .
[27] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, SIGMETRICS '02.
[28] Scott Shenker,et al. Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.
[29] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.
[30] Lada A. Adamic,et al. Zipf's law and the Internet , 2002, Glottometrics.
[31] B. Tadić. Adaptive random walks on the class of Web graphs , 2001, cond-mat/0110033.
[32] Matei Ripeanu,et al. Peer-to-peer architecture case study: Gnutella network , 2001, Proceedings First International Conference on Peer-to-Peer Computing.
[33] Lada A. Adamic,et al. Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[34] M. Newman,et al. Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.
[35] R. E. Amritkar,et al. Random spread on the family of small-world networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.
[36] Jinqiao Yu. Markov Chains and Random Walks , 2001 .
[37] László Lovász,et al. Random Walks on Graphs: A Survey , 1993 .
[38] Uriel Feige,et al. A Tight Lower Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.
[39] P. M. Lee,et al. Random Walks and Random Environments: Volume 1: Random Walks , 1995 .
[40] R. Motwani,et al. Randomized Algorithms: Markov Chains and Random Walks , 1995 .
[41] Uriel Feige,et al. Short random walks on graphs , 1993, SIAM J. Discret. Math..
[42] N. Madras,et al. THE SELF-AVOIDING WALK , 2006 .
[43] David Zuckerman,et al. A technique for lower bounding the cover time , 1990, STOC '90.
[44] David J. Aldous,et al. Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .
[45] Gordon Slade. The diffusion of self-avoiding random walk in high dimensions , 1987 .
[46] Daniel J. Amit,et al. Asymptotic behavior of the "true" self-avoiding walk , 1983 .
[47] G. Lawler. A self-avoiding random walk , 1980 .