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

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

2009-04-15

arxiv.org/abs/0904.2244v1

Mathematics

Optimization and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Fréchet Contingency Array Problem is Max-Plus Linear does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Fréchet Contingency Array Problem is Max-Plus Linear, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Fréchet Contingency Array Problem is Max-Plus Linear will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591598