scholarly journals On essentially conditional information inequalities

2011 ◽  
Author(s):  
Tarik Kaced ◽  
Andrei Romashchenko
Keyword(s):  
Information Inequalities ◽  
Conditional Information

Conditional Independences among Four Random Variables III: Final Conclusion

1999 ◽  
Vol 8 (3) ◽  
pp. 269-276 ◽  
Author(s):  
F. MATÚš
Keyword(s):  
Random Variables ◽  
Final Conclusion ◽  
Information Inequalities ◽  
Conditional Information ◽  
Element Set

The problem of probabilistic representability of semimatroids over a four-element set is solved. In this problem, one looks for all combinations of conditional independences within four random variables which can occur simultaneously. New properties of the stochastic conditional independences are deduced from conditional information inequalities. Examples of four-tuples of random variables are presented to show the probabilistic representability of three non-Ingleton semimatroids.

scholarly journals New Inequalities between Information Measures of Network Information Content

2013 ◽  
Vol 2013 ◽  
pp. 1-3 ◽  
Author(s):  
Pantelimon-George Popescu ◽  
Florin Pop ◽  
Alexandru Herişanu ◽  
Nicolae Ţăpuş
Keyword(s):  
Information Processing ◽  
Complex Systems ◽  
Complex Networks ◽  
Information Content ◽  
Discrete Case ◽  
Network Information ◽  
Information Inequalities ◽  
Information Measures ◽  
New Inequalities

We refine a classical logarithmic inequality using a discrete case of Bernoulli inequality, and then we refine furthermore two information inequalities between information measures for graphs, based on information functionals, presented by Dehmer and Mowshowitz in (2010) as Theorems 4.7 and 4.8. The inequalities refer to entropy-based measures of network information content and have a great impact for information processing in complex networks (a subarea of research in modeling of complex systems).

Sign in / Sign up

Export Citation Format

Share Document