In this talk I will discuss the use of a Domain Decomposition method to reduced the computational complexity of classical problems arising in Uncertainty Quantification and stochastic Partial Differential equations. The first problem concerns the determination of the Karhunen-Loeve decomposition of a stochastic process given its covariance function. We propose to solve independently the decomposition problem over a set of subdomains, each with low complexity cost, and subsequently assemble a reduced problem to determined the global problem solution. We propose error estimates to control the resulting approximation error. Second, these ideas are extended to construct an efficient sampling approach for elliptic problems with stochastic coefficients expanded in a KL form. Here, we rely on the resolution of low complexity local stochastic elliptic problems to exhibit contributions to the condensed stochastic problem for the unknown boundary values at the internal subdomain boundaries. By relying intensively on local resolutions, that can be performed independently, the proposed approaches are naturally suited to parallel implementation and we will provide scalability results.