CiteULike is a free online bibliography manager. Register and you can start organising your references online.

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

(15 Apr 2009)

Citation Format

[Posts]

View FullText article


ansobol's tags for this article

statistics tropical

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

In this paper we show that the so-called array Fréchet problem in Probability/Statistics is (max, +)-linear. The upper bound of Fréchet 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échet problem and the Monge property of bivariate distribution.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.