Before revision:  The  amortized update time  of both algorithms can be made worst-case by paying some sub-polynomial factors.
After revision:  The third algorithm maintains a polylog(n)-approximate spectral sparsifier in polylog(n) amortized update time of both algorithms can be made worst-case by paying some sub-polynomial factors.