Skip to content

Balaram Behera

Blog Posts on Theoretical Computer Science

  • Blog
  • Research
  • Resume
  • About
  • Contact

Recent Posts

  • Analysis of Randomized QuickSort
  • Key Probabilistic Concentration Bounds
  • Randomized QuickSort
  • Measure Theoretic Probability Theory
  • Graph Theory Fundamentals

Recent Comments

  • Analysis of Randomized QuickSort - Balaram Behera on Randomized QuickSort
  • Avantika on Key Probabilistic Concentration Bounds
  • Henry Fan on Welcome!
  • Key Probabilistic Concentration Bounds – Balaram Behera on Introduction to Probability Distributions
  • Graph Theory Fundamentals | Balaram Behera on Introduction to Graph Theory

September 2020

  • Home
  • 2020
  • September

Subscribe

To subscribe to this blog, click here.

To login or edit your account, click here.

Categories

  • Graph Algorithms
  • Graph Theory
  • Miscellaneous
  • Probability Theory
  • Randomized Algorithms

Archives

  • August 2021
  • September 2020
  • August 2020
  • July 2020
  • June 2020
  • May 2020
Probability Theory

Key Probabilistic Concentration Bounds

Sep 25, 2020 Balaram Behera1 Comment on Key Probabilistic Concentration Bounds

Especially in the analysis of randomized algorithms, probabilistic bounds play a pivotal role in the proving of probabilistic theorems. This blog aims to be a reference for such key results that will be used in the randomized analyses conducted in upcoming blogs. Foremost, we cover the all-important Markov and Chebyshev