For a given algorithm with expected runtime M, does there exist (in theory) an algorithm with equivalent guaranteed runtime?
No. See Chapter 2 of the book Randomized Algorithms by Motwani and Raghavan. They discuss a tree-evaluation problem for which:


any deterministic algorithm takes linear time;
there is a Las Vegas randomized algorithm with sublinear expected running time.