Towards network complexity

Matthias Dehmer; Frank Emmert-Streib

doi:10.1007/978-3-642-02466-5_68

Towards network complexity

Matthias Dehmer, Frank Emmert-Streib

Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

7 Sitaatiot (Scopus)

Abstrakti

In this paper, we briefly present a classification scheme of information-based network complexity measures. We will see that existing as well as novel measures can be divided into four major categories: (i) partition-based measures, (ii) non partition-based measures, (iii) non-parametric local measures and (iv) parametric local measures. In particular, it turns out that (ii)-(iv) can be obtained in polynomial time complexity because we use simple graph invariants, e.g., metrical properties of graphs. Finally, we present a generalization of existing local graph complexity measures to obtain parametric complexity measures.

Alkuperäiskieli	Englanti
Otsikko	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Sivut	707-714
Sivumäärä	8
Vuosikerta	4 LNICST
Painos	PART 1
DOI - pysyväislinkit	https://doi.org/10.1007/978-3-642-02466-5_68
Tila	Julkaistu - 2009
Julkaistu ulkoisesti	Kyllä
OKM-julkaisutyyppi	A4 Artikkeli konferenssijulkaisussa
Tapahtuma	1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 - Shanghai, Kiina Kesto: 23 helmik. 2009 → 25 helmik. 2009

Julkaisusarja

Nimi	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Numero	PART 1
Vuosikerta	4 LNICST
ISSN (painettu)	18678211

Conference

Conference	1st International Conference on Complex Sciences: Theory and Applications, Complex 2009
Maa/Alue	Kiina
Kaupunki	Shanghai
Ajanjakso	23/02/09 → 25/02/09

!!ASJC Scopus subject areas

Computer Networks and Communications

Pääsy asiakirjaan

10.1007/978-3-642-02466-5_68

Muut tiedostot ja linkit

Link to publication in Scopus

Siteeraa tätä

Dehmer, M., & Emmert-Streib, F. (2009). Towards network complexity. teoksessa Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (PART 1 toim., Vuosikerta 4 LNICST, Sivut 707-714). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vuosikerta 4 LNICST, Nro PART 1). https://doi.org/10.1007/978-3-642-02466-5_68

@inproceedings{d2225a7b845d4259a94d21418f8c881c,

title = "Towards network complexity",

abstract = "In this paper, we briefly present a classification scheme of information-based network complexity measures. We will see that existing as well as novel measures can be divided into four major categories: (i) partition-based measures, (ii) non partition-based measures, (iii) non-parametric local measures and (iv) parametric local measures. In particular, it turns out that (ii)-(iv) can be obtained in polynomial time complexity because we use simple graph invariants, e.g., metrical properties of graphs. Finally, we present a generalization of existing local graph complexity measures to obtain parametric complexity measures.",

keywords = "Information measures, Network complexity, Networks",

author = "Matthias Dehmer and Frank Emmert-Streib",

year = "2009",

doi = "10.1007/978-3-642-02466-5_68",

language = "English",

isbn = "3642024653",

volume = "4 LNICST",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",

number = "PART 1",

pages = "707--714",

booktitle = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",

edition = "PART 1",

note = "1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 ; Conference date: 23-02-2009 Through 25-02-2009",

}

Dehmer, M & Emmert-Streib, F 2009, Towards network complexity. julkaisussa Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. PART 1 toim, Vuosikerta 4 LNICST, Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, Nro PART 1, Vuosikerta 4 LNICST, Sivut 707-714, 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009, Shanghai, Kiina, 23/02/09. https://doi.org/10.1007/978-3-642-02466-5_68

Towards network complexity. / Dehmer, Matthias; Emmert-Streib, Frank.
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. Vuosikerta 4 LNICST PART 1. toim. 2009. s. 707-714 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vuosikerta 4 LNICST, Nro PART 1).

Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu

TY - GEN

T1 - Towards network complexity

AU - Dehmer, Matthias

AU - Emmert-Streib, Frank

PY - 2009

Y1 - 2009

N2 - In this paper, we briefly present a classification scheme of information-based network complexity measures. We will see that existing as well as novel measures can be divided into four major categories: (i) partition-based measures, (ii) non partition-based measures, (iii) non-parametric local measures and (iv) parametric local measures. In particular, it turns out that (ii)-(iv) can be obtained in polynomial time complexity because we use simple graph invariants, e.g., metrical properties of graphs. Finally, we present a generalization of existing local graph complexity measures to obtain parametric complexity measures.

AB - In this paper, we briefly present a classification scheme of information-based network complexity measures. We will see that existing as well as novel measures can be divided into four major categories: (i) partition-based measures, (ii) non partition-based measures, (iii) non-parametric local measures and (iv) parametric local measures. In particular, it turns out that (ii)-(iv) can be obtained in polynomial time complexity because we use simple graph invariants, e.g., metrical properties of graphs. Finally, we present a generalization of existing local graph complexity measures to obtain parametric complexity measures.

KW - Information measures

KW - Network complexity

KW - Networks

UR - http://www.scopus.com/inward/record.url?scp=84885886016&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02466-5_68

DO - 10.1007/978-3-642-02466-5_68

M3 - Conference contribution

AN - SCOPUS:84885886016

SN - 3642024653

SN - 9783642024658

VL - 4 LNICST

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

SP - 707

EP - 714

BT - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

T2 - 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009

Y2 - 23 February 2009 through 25 February 2009

ER -

Dehmer M, Emmert-Streib F. Towards network complexity. julkaisussa Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. PART 1 toim. Vuosikerta 4 LNICST. 2009. s. 707-714. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; PART 1). doi: 10.1007/978-3-642-02466-5_68

Towards network complexity

Abstrakti

Julkaisusarja

Conference

!!ASJC Scopus subject areas

Pääsy asiakirjaan

Muut tiedostot ja linkit

Sormenjälki

Siteeraa tätä