Universal construction mechanism for networks from one-dimensional symbol sequences

Frank Emmert-Streib

doi:10.1016/j.amc.2012.07.006

Universal construction mechanism for networks from one-dimensional symbol sequences

Frank Emmert-Streib^*

^*Corresponding author for this work

Queen's University Belfast

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

2 Citations (Scopus)

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.

Original language	English
Pages (from-to)	1020-1030
Number of pages	11
Journal	Applied Mathematics and Computation
Volume	219
Issue number	3
DOIs	https://doi.org/10.1016/j.amc.2012.07.006
Publication status	Published - 15 Oct 2012
Externally published	Yes

Keywords

Complex networks
Network construction
Random networks
Symbol sequences
Universal network construction

Access to Document

10.1016/j.amc.2012.07.006

Cite this

@article{c6245fb02a6d4272a78c5fed183b6788,

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 = oct,

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 Inc.",

number = "3",

}

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 - https://www.scopus.com/pages/publications/84867336661

U2 - 10.1016/j.amc.2012.07.006

DO - 10.1016/j.amc.2012.07.006

M3 - Article

AN - SCOPUS:84867336661

SN - 0096-3003

VL - 219

SP - 1020

EP - 1030

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 3

ER -

Universal construction mechanism for networks from one-dimensional symbol sequences

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this