Spreading and shortest paths in systems with sparse long-range connections
Spreading and shortest paths in systems with sparse long-range connections
复制标题
DOI：
10.1103/physreve.60.r6263
复制
发表时间：
1999-12-01
影响因子：
2.4
通讯作者：
Moukarzel, CF
中科院分区：
文献类型：
--
作者：
Moukarzel, CF
根据简单的规则进行传播（例如，的火灾或疾病）和最短路径的距离进行了研究的d维系统与一个小的密度p每个站点的远程连接（“小世界”格）。在无限大系统中，扩散量所覆盖的体积V（t）在所有维度上都是时间t的函数。由此，平均最短路径距离l（r）可以被计算为欧几里得距离r的函数。发现对于rr（c），l（r）与r相似.控制最短路径长度行为的特征长度r（c），在所有p>0的情况下随L几何发散。[S1063-651X（99）50312-7]。
Spreading according to simple rules (e.g., of fire or diseases) and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections (''small-world'' lattices). The volume V(t) covered by the spreading quantity on an infinite system is exactly calculated in all dimensions as a function of time t. From this, the average shortest-path distance l(r) can be calculated as a function of Euclidean distance r. It is found that l(r)similar to r for rr(c). The characteristic length r(c), which governs the behavior of shortest-path lengths, diverges logarithmically with L for all p>0. [S1063-651X(99)50312-7].