✦ LIBER ✦

Some upper bounds for relative entropy and applications

✍ Scribed by S.S. Dragomir; M.L. Scholz; J. Sunde

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 500 KB
Volume: 39
Category: Article
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(00)00089-4

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we derive some upper bounds for the relative entropy D(p 11 q) of two probability distribution and apply them to mutual information and entropy mapping. To achieve this, we use an inequality for the logarithm function, (2.3) below, and some classical inequalities such as the Kantorovic Inequality and Diaz-Metcalf Inequality.

📜 SIMILAR VOLUMES

An upper bound for the entropy and its a

An upper bound for the entropy and its applications to the maximal entropy problem

✍ Y. Alhassid; N. Agmon; R.D. Levine 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Some upper bounds for minimal trees

✍ J.M. Basart 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Some uniqueness results for upper bound

✍ F.R. McMorris; G.T. Myers 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 162 KB

The upper bound graphs that arise from exactly one (up to isomorphism) poser :~rc characterized. Weakening these conditions, the class of graphs whose intersection number is equal to the independence number is characterized. In this note all sets are finite and all graphs are connected, undirected,

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra

Relative entropy of DNA and its applicat

Relative entropy of DNA and its application

✍ Chun Li; Jun Wang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.