Jannis Dimitriadis

Rigorous Computing of Rectangle Scan Probabilities for Markov Increments

Extending recent work of Corrado, we derive an algorithm that computes rigorous upper and lower bounds for rectangle scan probabilities for Markov increments. We experimentally examine the closeness of the bounds computed by the algorithm and we examine the range of tractable input variables.