Universal construction mechanism for networks from one-dimensional symbol sequences

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

Standard

Universal construction mechanism for networks from one-dimensional symbol sequences. / Emmert-Streib, Frank.

In: Applied Mathematics and Computation, Vol. 219, No. 3, 15.10.2012, p. 1020-1030.

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

Bibtex - Download

@article{e81bf8f4c4514d06912ee58f7b0c2de8,

title = "Universal construction mechanism for networks from one-dimensional symbol sequences",

abstract = "In this paper we introduce construction mechanisms to generate directed networks from one-dimensional symbol sequences. We prove that any of these construction mechanism leads to the same undirected network. Further, we prove that the introduced construction mechanisms are universal in the sense that any undirected network can be generated by such a mechanism. In addition, we provide various numerical examples to demonstrate the applicability of the introduced mechanism.",

keywords = "Complex networks, Network construction, Random networks, Symbol sequences, Universal network construction",

author = "Frank Emmert-Streib",

year = "2012",

month = "10",

day = "15",

doi = "10.1016/j.amc.2012.07.006",

language = "English",

volume = "219",

pages = "1020--1030",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier",

number = "3",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Universal construction mechanism for networks from one-dimensional symbol sequences

AU - Emmert-Streib, Frank

PY - 2012/10/15

Y1 - 2012/10/15

N2 - In this paper we introduce construction mechanisms to generate directed networks from one-dimensional symbol sequences. We prove that any of these construction mechanism leads to the same undirected network. Further, we prove that the introduced construction mechanisms are universal in the sense that any undirected network can be generated by such a mechanism. In addition, we provide various numerical examples to demonstrate the applicability of the introduced mechanism.

AB - In this paper we introduce construction mechanisms to generate directed networks from one-dimensional symbol sequences. We prove that any of these construction mechanism leads to the same undirected network. Further, we prove that the introduced construction mechanisms are universal in the sense that any undirected network can be generated by such a mechanism. In addition, we provide various numerical examples to demonstrate the applicability of the introduced mechanism.

KW - Complex networks

KW - Network construction

KW - Random networks

KW - Symbol sequences

KW - Universal network construction

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

U2 - 10.1016/j.amc.2012.07.006

DO - 10.1016/j.amc.2012.07.006

M3 - Article

VL - 219

SP - 1020

EP - 1030

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

IS - 3

ER -

TUTCRIS Research Portal