Determinantal point processes (DPPs) enable the modeling of repulsion: they provide diverse sets of points. The repulsion is encoded in a kernel K that can be seen, in a discrete setting, as a matrix storing the similarity between points. The main exact algorithm to sample DPPs uses the spectral decomposition of K, a computation that becomes costly when dealing with a high number of points. Here we present an alternative exact algorithm to sample in discrete spaces that avoids the eigenvalues and the eigenvectors computation. The method used here is innovative, and numerical experiments show competitive results with respect to the initial algorithm.

Let {xt } be a discrete-time multivariate stationary process possessing an infinite autoregressive representation and let ΓB (k), ΓF (k) and Γ be the block Toeplitz covariance matrices of xB (k) = [x′–1, x′ –2, · ··, x′–k ]′, xF (k) = [x′1, x′2 · ·· x′k] and x = [·· ·x′–2, x′–1, x′0, x′1, x′2 · ··]′ respectively, where k ≧ 1, is finite or infinite. Also let φ m ,n (j) and δm,n (u) be the coefficients of xt + j and xt – u respectively in the linear least-squares interpolator of xt from xt + 1, · ··, xt + m ; xt − 1, · ··, xt – n , where m, n ≧ 0, 0 ≦ j ≦ m, 0 ≦ u ≦ n are integers, zt (m, n) denote the interpolation error and τ2(m, n) = E[zt (m, n)zt (m, n)′]. A physical interpretation for the components of ΓB (k)–1, ΓF (k)–1 and Γ–1 is given by relating these components to the φm,n (j) δm,n (u) and τ 2(m, n). A similar result is shown to hold also for the estimators of ΓB (k)–l and the interpolation parameters when these have been obtained from a realization of length T of {xt }. Some of the applications of the results are considered.