The Fréchet Contingency Array Problem is Max-Plus Linear Export

@article{citeulike:4324828, abstract = {In this paper we show that the so-called array Fr\'echet problem in Probability/Statistics is (max, +)-linear. The upper bound of Fr\'echet is obtained using simple arguments from residuation theory and lattice distributivity. The lower bound is obtained as a loop invariant of a greedy algorithm. The algorithm is based on the max-plus linearity of the Fr\'echet problem and the Monge property of bivariate distribution.}, archivePrefix = {arXiv}, author = {Truffet, Laurent}, citeulike-article-id = {4324828}, citeulike-linkout-0 = {http://arxiv.org/abs/0904.2244}, citeulike-linkout-1 = {http://arxiv.org/pdf/0904.2244}, day = {15}, eprint = {0904.2244}, keywords = {statistics, tropical}, month = {Apr}, posted-at = {2009-04-16 07:47:18}, priority = {2}, title = {The Fr\'echet Contingency Array Problem is Max-Plus Linear}, url = {http://arxiv.org/abs/0904.2244}, year = {2009} }

TY - JOUR ID - citeulike:4324828 L3 - citeulike-article-id:4324828 N2 - In this paper we show that the so-called array Fr\'echet problem in Probability/Statistics is (max, +)-linear. The upper bound of Fr\'echet is obtained using simple arguments from residuation theory and lattice distributivity. The lower bound is obtained as a loop invariant of a greedy algorithm. The algorithm is based on the max-plus linearity of the Fr\'echet problem and the Monge property of bivariate distribution. TI - The Fr\'echet Contingency Array Problem is Max-Plus Linear KW - statistics KW - tropical AU - Truffet, Laurent PY - 2009/Apr/15/ UR - http://arxiv.org/abs/0904.2244 ER -