pub fn walk_cycle_worst_case<F: Float>(steps: &[usize], epsilon: F) -> (F, F)
Walk a cycle with worst-case (maximal) error at each step.
This tests the theoretical upper bound: each step incurs the maximum allowed error ε.