On the degeneracy of the Randić entropy and related graph measures

Matthias Dehmer; Zengqiang Chen; Abbe Mowshowitz; Herbert Jodlbauer; Frank Emmert-Streib; Yongtang Shi; Shailesh Tripathi; Chengyi Xia

doi:10.1016/j.ins.2018.11.011

On the degeneracy of the Randić entropy and related graph measures

Matthias Dehmer^*
, Zengqiang Chen
, Abbe Mowshowitz
, Herbert Jodlbauer
, Frank Emmert-Streib
, Yongtang Shi
, Shailesh Tripathi
, Chengyi Xia

^*Corresponding author for this work

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

2 Citations (Scopus)

Abstract

Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randić entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures’ applicability to deterministic and non-deterministic networks.

Original language	English
Pages (from-to)	680-687
Journal	Information Sciences
Volume	501
Early online date	2018
DOIs	https://doi.org/10.1016/j.ins.2018.11.011
Publication status	Published - Oct 2019
Publication type	A1 Journal article-refereed

Keywords

Data science
Graphs
Networks
Quantitative graph theory
Structural graph measures
Structural network analysis

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

Software
Control and Systems Engineering
Theoretical Computer Science
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/j.ins.2018.11.011

Cite this

@article{b9a9c785b55a476fb55b50701412a37f,

title = "On the degeneracy of the Randi{\'c} entropy and related graph measures",

abstract = "Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randi{\'c} entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures{\textquoteright} applicability to deterministic and non-deterministic networks.",

keywords = "Data science, Graphs, Networks, Quantitative graph theory, Structural graph measures, Structural network analysis",

author = "Matthias Dehmer and Zengqiang Chen and Abbe Mowshowitz and Herbert Jodlbauer and Frank Emmert-Streib and Yongtang Shi and Shailesh Tripathi and Chengyi Xia",

note = "EXT={"}Tripathi, Shailesh{"}",

year = "2019",

month = oct,

doi = "10.1016/j.ins.2018.11.011",

language = "English",

volume = "501",

pages = "680--687",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - On the degeneracy of the Randić entropy and related graph measures

AU - Dehmer, Matthias

AU - Chen, Zengqiang

AU - Mowshowitz, Abbe

AU - Jodlbauer, Herbert

AU - Emmert-Streib, Frank

AU - Shi, Yongtang

AU - Tripathi, Shailesh

AU - Xia, Chengyi

N1 - EXT="Tripathi, Shailesh"

PY - 2019/10

Y1 - 2019/10

N2 - Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randić entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures’ applicability to deterministic and non-deterministic networks.

AB - Numerous quantitative graph measures have been defined and applied in various disciplines. Such measures may be differentiated according to whether they are information-theoretic or non-information-theoretic. In this paper, we examine an important property of Randić entropy, an information-theoretic measure, and examine some related graph measures based on random roots. In particular, we investigate the degeneracy of these structural graph measures and discuss numerical results. Finally, we draw some conclusions about the measures’ applicability to deterministic and non-deterministic networks.

KW - Data science

KW - Graphs

KW - Networks

KW - Quantitative graph theory

KW - Structural graph measures

KW - Structural network analysis

U2 - 10.1016/j.ins.2018.11.011

DO - 10.1016/j.ins.2018.11.011

M3 - Article

AN - SCOPUS:85057760552

SN - 0020-0255

VL - 501

SP - 680

EP - 687

JO - Information Sciences

JF - Information Sciences

ER -

On the degeneracy of the Randić entropy and related graph measures

Abstract

Keywords

Publication forum classification

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this