Rearrangement Algorithm and Maximum Entropy
39 Pages Posted: 23 Dec 2015 Last revised: 17 Aug 2017
Date Written: June 10, 2017
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 consequence of this result is that the RA can be used as a stable algorithm for inferring a dependence that is economically meaningful.
Keywords: Entropy, Block Rearrangement Algorithm, Inferring dependence, Maximum determinant
JEL Classification: C60
Suggested Citation: Suggested Citation
Bernard, Carole and Bondarenko, Oleg and Vanduffel, Steven, Rearrangement Algorithm and Maximum Entropy (June 10, 2017). Available at SSRN: https://ssrn.com/abstract=2705708 or http://dx.doi.org/10.2139/ssrn.2705708
Do you have a job opening that you would like to promote on SSRN?
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.