Universal construction mechanism for networks from one-dimensional symbol sequences

    Research output: Contribution to journalArticleScientificpeer-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 languageEnglish
    Pages (from-to)1020-1030
    Number of pages11
    JournalApplied Mathematics and Computation
    Volume219
    Issue number3
    DOIs
    Publication statusPublished - 15 Oct 2012
    Publication typeA1 Journal article-refereed

    Keywords

    • Complex networks
    • Network construction
    • Random networks
    • Symbol sequences
    • Universal network construction

    ASJC Scopus subject areas

    • Applied Mathematics
    • Computational Mathematics

    Fingerprint

    Dive into the research topics of 'Universal construction mechanism for networks from one-dimensional symbol sequences'. Together they form a unique fingerprint.

    Cite this