随机算法 (Fall 2011): Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
VisualWikitext
imported>WikiSysop
Line 43: Line 43:
#* [[随机算法 (Fall 2011)/Randomized Rounding|Randomized Rounding]]
#* [[随机算法 (Fall 2011)/Randomized Rounding|Randomized Rounding]]
# Markov Chain and Random Walk
# Markov Chain and Random Walk
#* [[随机算法 (Fall 2011)/Markov Chains|Markov Chains]]
#* [[随机算法 (Fall 2011)/Random Walks on Undirected Graphs|Random Walks on Undirected Graphs]]
# Random Walk Algorithms
# Random Walk Algorithms
# Coupling and Mixing Time
# Coupling and Mixing Time

Revision as of 05:39, 19 July 2011

Lecture Notes

  1. Introduction
  2. Probability Basics
  3. Balls and Bins
  4. Moment and Deviation
  5. Hashing and Fingerprinting
  6. Chernoff Bound
  7. Concentration of Measure
  8. Dimension Reduction
  9. The Probabilistic Method
  10. Approximation Algorithms
  11. Markov Chain and Random Walk
  12. Random Walk Algorithms
  13. Coupling and Mixing Time
  14. Expander Graphs
  15. Sampling and Counting
  16. MCMC
  17. On-line Algorithms
  18. Complexity
  1. Rapid mixing random walks
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2011)&oldid=4444"