[Back]

R. Kovacevic, A. Pichler:
"Tree Approximation for Discrete Time Stochastic Processes - A Process Distance Approach";
Annals of Operations Research, 235 (2015), 1; 395 - 521.

Approximating stochastic processes by scenario trees is important in decision analysis. In this paper we focus on improving the approximation quality of trees by smaller, tractable trees. In particular we propose and analyze an iterative algorithm to construct improved approximations: given a stochastic process in discrete time and starting with an arbitrary, approximating tree, the algorithm improves both, the probabilities on the tree and the related path-values of the smaller tree, leading to significantly improved approximations of the initial stochastic process. The quality of the approximation is measured by the process distance (nested distance), which was introduced recently. For the important case of quadratic process distances the algorithm finds locally best approximating trees in finitely many iterations by generalizing multistage k-means clustering.

Stochastic processes and trees, Wasserstein and Kantorovich distance, Tree approximation, Optimal transport, Facility location

http://dx.doi.org/10.1007/s10479-015-1994-2