Coin Flipping: Using Markov Chains to Compute Expected Times and Probabilities of a Substring
How to use Markov Chains to Compute Expected Times and Probabilities of Coin Flips.
top of page
See What We're All About on Substack
Or
Upskill Today at Our Sister Service
Kash Chandran
Jan 282 min read
Branching Processes and Extinction
Classic branching process question with variants that appear frequently in quant finance interviews.
17 views0 comments
Kash Chandran
Jan 211 min read
Three Stocks with Pairwise Correlations ρ: What Values can ρ Take?
Classic question testing Linear Algebra in the context of Finance.
9 views0 comments
Kash Chandran
Oct 3, 20231 min read
Newborns and Bayes' Rule
Classic problem of computing the gender of a newborn using Bayes' Rule and Conditional Probability.
16 views0 comments
Kash Chandran
Sep 1, 20232 min read
The Birthday Problem in Probability
This is a classic problem and has many variants - so you should definitely understand the approach.
32 views0 comments
bottom of page