Cutoff for random walk on dynamical Erdős–Rényi graph
暂无分享,去创建一个
[1] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[2] Brendan D. McKay,et al. Asymptotic enumeration by degree sequence of graphs with degreeso(n1/2) , 1991, Comb..
[3] Alan M. Frieze,et al. Cover time of a random graph with given degree sequence , 2012, Discret. Math..
[4] Remco van der Hofstad,et al. Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.
[5] Bruce A. Reed,et al. The evolution of the mixing rate of a simple random walk on the giant component of a random graph , 2008, Random Struct. Algorithms.
[6] Allan Sly,et al. Random walks on the random graph , 2015, 1504.01999.
[7] A. Frieze,et al. Introduction to Random Graphs , 2016 .
[8] Mixing time for random walk on supercritical dynamical percolation , 2017, Probability Theory and Related Fields.
[9] Mark Jerrum,et al. Approximating the Permanent , 1989, SIAM J. Comput..
[10] Nicholas C. Wormald,et al. The mixing time of the giant component of a random graph , 2006, Random Struct. Algorithms.
[11] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..
[12] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[13] Y. Peres,et al. Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times , 2013, 1308.6193.
[14] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.
[15] Yuval Peresy,et al. Dynamical Percolation , 1996 .
[16] Yuval Peres,et al. Anatomy of the giant component: The strictly supercritical regime , 2012, Eur. J. Comb..
[17] A. Sokal,et al. Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .
[18] B. Reed,et al. Faster Mixing and Small Bottlenecks , 2006 .
[19] Lutz Warnke,et al. On the Method of Typical Bounded Differences , 2012, Combinatorics, Probability and Computing.
[20] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.
[21] F. Hollander,et al. Mixing times of random walks on dynamic configuration models , 2016, The Annals of Applied Probability.
[22] F. Hollander,et al. Random walks on dynamic configuration models:A trichotomy , 2018, Stochastic Processes and their Applications.