I don't think it is that black and white. The routing system could propagate bad news faster than good news
I am not sure if this is true...
I am no routing expert, but i think that withdrawing a route is inherently
slower than advertising a new route, at least in path vector algorithms.
The problem is that to detect that there is no route to a certain, all the
alternative routes with increasing AS path are tried, which is inherently
slow.
This would be similar to the count to infinity problem, but with different AS path.
This implies that the time to converge is proportional to the number of ASes in the network.