Connections between Classical and Parametric Network Entropies

M. Dehmer; A. Mowshowitz; Frank Emmert-Streib

doi:10.1371/journal.pone.0015733

Connections between Classical and Parametric Network Entropies

M. Dehmer, A. Mowshowitz, Frank Emmert-Streib

Research output: Contribution to journal › Article › peer-review

20 Citations (Scopus)

Abstract

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.

Original language	English
Article number	e15733
Journal	PLoS ONE
Volume	6
Issue number	1
DOIs	https://doi.org/10.1371/journal.pone.0015733
Publication status	Published - 2011

ASJC Scopus subject areas

Agricultural and Biological Sciences(all)
Biochemistry, Genetics and Molecular Biology(all)
Medicine(all)

Access to Document

10.1371/journal.pone.0015733

Cite this

@article{aea1078e810748ffbd98a1214bd29807,

title = "Connections between Classical and Parametric Network Entropies",

abstract = "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.",

author = "M. Dehmer and A. Mowshowitz and Frank Emmert-Streib",

year = "2011",

doi = "10.1371/journal.pone.0015733",

language = "English",

volume = "6",

journal = "PLoS One",

issn = "1932-6203",

publisher = "Public Library of Science (PLOS)",

number = "1",

}

TY - JOUR

T1 - Connections between Classical and Parametric Network Entropies

AU - Dehmer, M.

AU - Mowshowitz, A.

AU - Emmert-Streib, Frank

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1371/journal.pone.0015733

DO - 10.1371/journal.pone.0015733

M3 - Article

VL - 6

JO - PLoS One

JF - PLoS One

SN - 1932-6203

IS - 1

M1 - e15733

ER -

Connections between Classical and Parametric Network Entropies

Abstract

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this