Summary: The Mizuno-Todd-Ye predictor-corrector method based on two neighborhoods \({\mathcal D}(\alpha)\subset {\mathcal D}(\bar \alpha)\) of the central path of a monotone homogeneous linear complementarity problem is analyzed, where \({\mathcal D}(\alpha)\) is composed of all feasible points with \(\delta\)-proximity to the central path less than or equal to \(\alpha\). The largest allowable value for \(\bar\alpha\) is \(\approx 1.76\). For a specific choice of \(\alpha\) and \(\bar\alpha\) a lower bound of \({\mathcal X}/\sqrt n\) is obtained for the stepsize along the affine-scaling direction, where \({\mathcal X}_n\) has an asymptotic value greater than 1.08. For \(n \geq 400\) it is shown that \({\mathcal X}_n>1.05\). The algorithm has \(O(\sqrt n L)\)-iteration complexity under general conditions and quadratic convergence under the strict complementarity assumption.