一类具有边际长程连接的网络的超扩散
Superdiffusion in a class of networks with marginal long-range connections
摘要:
引入了一类由一维正则格点和一组长程链路组成的立方网络。由正整数k参数化的网络通过从一维晶格开始并迭代地将度为2的每个站点与度为2的第$k$个相邻站点连接来构造。根据要连接的站点对的选择方式,定义了各种随机和规则网络,所有这些网络都具有边缘指数s=1的$P_>(l)\sim l^{-s}$形式的幂律边长分布。在所有这些网络中,最短路径的长度随着距离的幂而增长,随机游走是超扩散的。应用重整化群方法,对k=1和k=2的规则网络,精确计算了相应的最短路径维数和随机行走维数;在其他情况下,用数值方法估计。虽然s=1适用于这类的所有代表,但发现上述数量取决于由k和其他参数控制的网络结构的细节。
英文摘要:
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively connecting each site of degree 2 with a $k$th neighboring site of degree 2. Specifying the way pairs of sites to be connected are selected, various random and regular networks are defined, all of which have a power-law edge-length distribution of the form $P_>(l)\sim l^{-s}$ with the marginal exponent s=1. In all these networks, lengths of shortest paths grow as a power of the distance and random walk is super-diffusive. Applying a renormalization group method, the corresponding shortest-path dimensions and random-walk dimensions are calculated exactly for k=1 networks and for k=2 regular networks; in other cases, they are estimated by numerical methods. Although, s=1 holds for all representatives of this class, the above quantities are found to depend on the details of the structure of networks controlled by k and other parameters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。