有先行者优势的确定性网络

Deterministic networks with first-mover advantage

提出了一个确定性网络模型.模型考虑了新生成节点有不同的强弱状态,用节点度刻画节点的强弱,即强节点的度比较大.通过解析计算,得到了网络的特征系数,其特点是幂律度分布、大集聚系数和幂律簇度相关性,即模型生成了一个无标度层次网络.认为网络是无标度的是由于其生成方式上的特点,越早生成的节点拥有的度越大,这与BA(Barabási-Albert)无标度网络生长方式相似.如果节点度代表了个体拥有的资源、能力及社会关系等,那么越早生成的节点度越大,恰好对应于占先策略,即先行者优势.

A simply deterministic network model is proposed, in which new nodes have two statuses： strong and ordinary. Nodes＇ statuses are depicted by node degree and strong nodes have large degrees. The relevant network parameters are analyzed. The distinct featurs of this web are power-law degree distribution, high clustering and power-law clustering-degree correlations. Thus our network is a scale- free hierarchical one. It is thought that the scale-free property in this web roots in construction method, that the earlier a node is created, the larger degree it will have, which is similar to BA （Barabfisi-Albert） scale-free model. I5 node degree is regarded as capacity, ability or social relations that individual possesses, the large degree of earlier nodes just corresponds to taking precedence, that is the first-mover advantage.