Universal construction mechanism for networks from one-dimensional symbol sequences

作者:

Highlights:

摘要

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.

论文关键词:Complex networks,Network construction,Symbol sequences,Random networks,Universal network construction

论文评审过程:Available online 26 July 2012.

论文官网地址:https://doi.org/10.1016/j.amc.2012.07.006