Rearrangement algorithm and maximum entropy
Carole Bernard (),
Oleg Bondarenko () and
Steven Vanduffel ()
Additional contact information
Carole Bernard: Grenoble Ecole de Management
Oleg Bondarenko: University of Illinois at Chicago
Steven Vanduffel: Vrije Universiteit Brussel (VUB)
Annals of Operations Research, 2018, vol. 261, issue 1, 107-134
Abstract We study properties of the block rearrangement algorithm (BRA) in the context of inferring dependence among variables given their marginal distributions and the distribution of their sum. We show that when all distributions are Gaussian the BRA yields solutions that are “close to each other” and exhibit almost maximum entropy, i.e., the inferred dependence is Gaussian with a correlation matrix that has maximum possible determinant. We provide evidence that, when the distributions are no longer Gaussian, the property of maximum determinant continues to hold. The consequences of these findings are that the BRA can be used as a stable algorithm for inferring a dependence that is economically meaningful.
Keywords: Entropy; Block rearrangement algorithm; Inferring dependence (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2612-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:261:y:2018:i:1:d:10.1007_s10479-017-2612-2
Ordering information: This journal article can be ordered from
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla ().