The cover time of two classes of random graphs
暂无分享,去创建一个
[1] Alan M. Frieze,et al. The cover time of sparse random graphs. , 2003, SODA '03.
[2] Mark Jerrum,et al. The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .
[3] D. Aldous. On the time taken by random walks on finite groups to visit every state , 1983 .
[4] Béla Bollobás,et al. Random Graphs , 1985 .
[5] Béla Bollobás,et al. The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.
[6] Uriel Feige,et al. A Tight Upper Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.
[7] P. A. P. Moran,et al. An introduction to probability theory , 1968 .
[8] N. Alon. Tools from higher algebra , 1996 .
[9] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[10] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[11] J. W. Brown,et al. Complex Variables and Applications , 1985 .
[12] Uriel Feige,et al. A Tight Lower Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.
[13] Amin Saberi,et al. On certain connectivity properties of the Internet topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[14] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[15] Béla Bollobás,et al. The Diameter of a Scale-Free Random Graph , 2004, Comb..
[16] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[17] Johan Jonasson. On the Cover Time for Random Walks on Random Graphs , 1998, Comb. Probab. Comput..
[18] L. Lovász. Combinatorial problems and exercises , 1979 .