Connections between classical and parametric network entropies

Matthias Dehmer; Abbe Mowshowitz; Frank Emmert-Streib

doi:10.1371/journal.pone.0015733

Connections between classical and parametric network entropies

Matthias Dehmer^*
, Abbe Mowshowitz
, Frank Emmert-Streib

^*Corresponding author for this work

Private University for Health Sciences, Medical Informatics and Technology
City University of New York
Queen's University Belfast

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

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
Externally published	Yes

Access to Document

10.1371/journal.pone.0015733

Cite this

@article{8b159003c7e84128ad51a721c1b3ff42,

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 = "Matthias Dehmer and Abbe 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",

number = "1",

}

TY - JOUR

T1 - Connections between classical and parametric network entropies

AU - Dehmer, Matthias

AU - Mowshowitz, Abbe

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.

UR - https://www.scopus.com/pages/publications/79251580952

U2 - 10.1371/journal.pone.0015733

DO - 10.1371/journal.pone.0015733

M3 - Article

C2 - 21246046

AN - SCOPUS:79251580952

SN - 1932-6203

VL - 6

JO - PLoS ONE

JF - PLoS ONE

IS - 1

M1 - e15733

ER -

Connections between classical and parametric network entropies

Abstract

Access to Document

Other files and links

Fingerprint

Cite this