Analytical forms for most likely matrices derived from incomplete information

DOI10.1080/00207721.2010.502600zbMath1258.93072arXiv1110.0819OpenAlexW3105712774MaRDI QIDQ4911078

Kostas N. Oikonomou

Publication date: 13 March 2013

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0819

zbMATH Keywords

convex optimizationmaximum entropycommunications networksoptimal estimationcontingency tabletraffic matrixanalytical formmost likely

Mathematics Subject Classification ID

Convex programming (90C25) Control/observation systems with incomplete information (93C41) Communication theory (94A05)

Cites Work

• Unnamed Item
• The many facets of internet topology and traffic
• Maximum entropy in applied econometric research
• Multilevel aggregation of central server models: a minimum relative entropy approach
• Probability Theory
• Application of Maximum Entropy Principle in Key Sector Analysis
• Model reduction of general queueing networks
• Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables

This page was built for publication: Analytical forms for most likely matrices derived from incomplete information