Showing 1 - 3 of 3
We study properties of the Rearrangement Algorithm (RA) in the context of inferring dependence among variables given their marginal distributions and the distribution of the sum. We show that the RA yields solutions that are “close to each other” and exhibit almost maximum entropy. The...
Persistent link: https://www.econbiz.de/10012970429
Persistent link: https://www.econbiz.de/10012549100
Persistent link: https://www.econbiz.de/10011871464