There are many problems in Computer Science where you have to work with the notion of paths for any given graph. For CTMCs we also need some kind of path notion. Consider the following CTMC: The above… more →
Mathematical Reasoningwrote 1 month ago: Exercise 7.12: Let be the sum of independent rolls of a fair dice. Show that, for any , . Solution: … more →
wrote 1 month ago: An interesting conundrum from Arnaud Guillin: can you find an MCMC setting where there are two Marko … more →
wrote 2 months ago: Lately I have stopped reading “Probability and computing”, since I found some gaps in t … more →
wrote 7 months ago: Sabermetrics has come around on the stolen base a bit. Back in the Moneyball era, the steal was a no … more →
wrote 11 months ago: Last year in February, I posted some links to famous black mathematicians to highlight their signifi … more →
wrote 11 months ago: So continuing my previous post about Bayesian Statistic, now let’s have a look how to sample/g … more →
wrote 1 year ago: This post (last post ever!) assumes some knowledge of Markov chains (Wikipedia). In 2004, two profes … more →
wrote 1 year ago: This is my first literate Haskell post, and actually my first post on Haskell, and my first attempt … more →
wrote 1 year ago: In the latest Garfield Remix Project, we bring you the combination of Garfield with a Markov Chain a … more →
wrote 2 years ago: There are many problems in Computer Science where you have to work with the notion of paths for any … more →
wrote 2 years ago: In previous post I have defined the Continuous Time Markov Chain (CTMC) model. Now it would be inter … more →
wrote 2 years ago: I’m starting a series of articles on well-known stochastic processes denoted by Continuous Tim … more →