Scale-free networks on lattices.
Scale-free networks on lattices.
复制标题
DOI：
10.1103/physrevlett.89.218701
复制
发表时间：
2002-05
影响因子：
8.6
通讯作者：
A. Rozenfeld;R. Cohen;D. ben-Avraham;S. Havlin
中科院分区：
文献类型：
--
作者：
A. Rozenfeld;R. Cohen;D. ben-Avraham;S. Havlin
我们提出了一种方法嵌入无标度网络，度分布Pk约为k（-lambda），在经常欧几里德格占地理属性。嵌入是由一个自然的约束最小化的总长度的链接在系统中。我们发现，λ>2的所有网络都可以成功地嵌入到（欧几里德）距离xi，该距离可以根据外部参数的变化而变大。连续化学壳的簇被发现是紧凑的（分形维数为df=d），而任何两个站点之间的最短路径的维数小于1：dmin=（lambda-2）/（lambda-1-1/d），与所有其他已知的分形和无序晶格的例子相反。
We suggest a method for embedding scale-free networks, with degree distribution Pk approximately k(-lambda), in regular Euclidean lattices accounting for geographical properties. The embedding is driven by a natural constraint of minimization of the total length of the links in the system. We find that all networks with lambda>2 can be successfully embedded up to a (Euclidean) distance xi which can be made as large as desired upon the changing of an external parameter. Clusters of successive chemical shells are found to be compact (the fractal dimension is df=d), while the dimension of the shortest path between any two sites is smaller than 1: dmin=(lambda-2)/(lambda-1-1/d), contrary to all other known examples of fractals and disordered lattices.