Connections between classical and parametric network entropies.
This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign probabilities to the vertices. The inequalities established in this paper relating classical and parametric measures lay a foundation for systematic classification of entropy-based measures of graph complexity.
Institute for Bioinformatics and Translational Research, UMIT, Hall in Tirol, Austria. matthias.dehmer@umit.at
Matthias
M
Dehmer
Abbe
A
Mowshowitz
Frank
F
Emmert-Streib
D000465:Algorithms; D003196:Computer Graphics; D019277:Entropy; D009716:Numerical Analysis, Computer-Assisted; D011336:Probability
IET Syst Biol. 2011 May;5(3):185-207
21639592
IET Syst Biol. 2007 Mar;1(2):89-119
17441552
Phys Rev E Stat Nonlin Soft Matter Phys. 2007 Sep;76(3 Pt 2):036115
17930314
Comput Chem. 2001 Jul;25(4):393-9
11459353
BMC Syst Biol. 2009 Mar 19;3:35
19298671
Bioinformatics. 2008 Nov 15;24(22):2579-85
18820265
J Chem Inf Comput Sci. 2000 Jul;40(4):920-6
10955519
Phys Rev E Stat Nonlin Soft Matter Phys. 2008 Oct;78(4 Pt 2):046114
18999500
Bull Math Biophys. 1968 Mar;30(1):175-204
5666816
Phys Rev E Stat Nonlin Soft Matter Phys. 2009 Oct;80(4 Pt 2):045102
19905379
J Chem Inf Model. 2009 Jul;49(7):1655-63
19530677