Universal construction mechanism for networks from one-dimensional symbol sequences
Tutkimustuotos › › vertaisarvioitu
Yksityiskohdat
| Alkuperäiskieli | Englanti |
|---|---|
| Sivut | 1020-1030 |
| Sivumäärä | 11 |
| Julkaisu | Applied Mathematics and Computation |
| Vuosikerta | 219 |
| Numero | 3 |
| DOI - pysyväislinkit | |
| Tila | Julkaistu - 15 lokakuuta 2012 |
| OKM-julkaisutyyppi | A1 Alkuperäisartikkeli |
Tiivistelmä
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.