Fill's algorithm for absolutely continuous stochastically monotone kernels.
Fourier analysis of iterative aggregation-disaggregation methods for nearly circulant stochastic matrices
We introduce a new way of the analysis of iterative aggregation-disaggregation methods for computing stationary probability distribution vectors of stochastic matrices. This new approach is based on the Fourier transform of the error propagation matrix. Exact formula for its spectrum can be obtained if the stochastic matrix is circulant. Some examples are presented.