Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
6 views6 pages

Courseplan - Randomized Algorithms

The course on Randomised Algorithms, starting April 7, 2025, covers the role of randomness in algorithm design, focusing on probability theory and its applications in various fields. It includes foundational topics such as basic probability, the probabilistic method, and the second moment method, as well as property testing and graph properties. The course culminates in a final report, with key deliverables including a midterm report and references for further reading.

Uploaded by

arrow8798051
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views6 pages

Courseplan - Randomized Algorithms

The course on Randomised Algorithms, starting April 7, 2025, covers the role of randomness in algorithm design, focusing on probability theory and its applications in various fields. It includes foundational topics such as basic probability, the probabilistic method, and the second moment method, as well as property testing and graph properties. The course culminates in a final report, with key deliverables including a midterm report and references for further reading.

Uploaded by

arrow8798051
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Course Overview: Randomised Algorithms

When? April 7, 2025


Course Overview

Introduction to the power of randomness in algorithm


design
Analyze randomized techniques using probability theory
Learn applications in property testing, graph theory, and
complexity
Explore derandomization and lower bound techniques
Weekly theoretical concepts reinforced through examples
and proofs
Weeks 1–3: Foundations

Week 1: Basic Probability Theory


Probability spaces, events, independence
Random variables, expectation, variance
Markov, Chebyshev, and Chernoff bounds

Week 2: The Probabilistic Method


Counting and expectation arguments
Derandomization with conditional expectations

Week 3: Second Moment Method


Using variance to strengthen probability bounds
Conditional expectation inequalities
Weeks 4–6: Testing and Local Lemma

Week 4: Property Testing


Sublinear algorithms for testing global properties
Monotonicity and array properties

Midterm Report Submission

Week 5: Graph Properties


Testing connectivity and bipartiteness
Models for dense and bounded-degree graphs

Week 6: Lovász Local Lemma


Symmetric and asymmetric versions
Applications and algorithmic LLL (Moser-Tardos)
Weeks 7–8: Yao’s Lemma and Final Report

Week 7: Yao’s Lemma


Minimax principle and proof
Lower bounds for randomized algorithms

Week 8: Final Report


Recap and deeper exploration
Final write-up and optional presentation

Deliverables
Midterm Report (Week 4)
Final Report (Week 8)
References

Michael Mitzenmacher and Eli Upfal, Probability and


Computing
Lecture notes and supplementary papers
Online resources for advanced topics (to be shared)

Thank you! Questions?

You might also like