New Inequalities between Information Measures of Network Information Content
2013 ◽
Vol 2013
◽
pp. 1-3
◽
Keyword(s):
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).
2018 ◽
Detecting Determinism in Time Series with Complex Networks Constructed Using a Compression Algorithm
2018 ◽
Vol 28
(13)
◽
pp. 1850165
Keyword(s):
2014 ◽
pp. 258-261
2013 ◽
Vol 756-759
◽
pp. 1164-1167
2008 ◽
Vol 201
(1-2)
◽
pp. 82-94
◽
2011 ◽
Vol 369
(1952)
◽
pp. 3697-3707
◽
Keyword(s):