arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1710.01600physics.soc-ph
收藏

复杂网络的几何演化

Geometric evolution of complex networks

Charles Murphy, Antoine Allard, Edward Laurence, Guillaume St-Onge, Louis J. Dubé

摘要:

我们提出了一个一般类的几何网络增长机制,通过均匀连接,在一个给定的时间$t$创建的链接均匀分布在一个新的节点和均匀选择的连接节点之间。这是通过在均匀分布在均匀度规空间中的节点之间根据具有逆温度$β$和一般含时化学势$μ(t)$的费米-狄拉克连接概率创建链接来实现的。化学势限制了新创建的链接的空间范围。使用隐变量框架,我们得到的度序列的解析表达式,并表明,$μ(t)$可以固定,以产生任何给定的度分布,包括无标度分布。此外,我们发现,根据节点在网络中出现的顺序-它的$\textit{history}$ -度-度相关性可以被调整为独立的或独立的。通过平均聚集系数$\langle c \rangle$考察了几何结构对结构的影响。在热力学极限,我们确定了一个随机制度之间的相变,其中$\langle c \rangle \rightarrow 0$当$β< β_\mathrm{c}$和几何制度,其中$\langle c \rangle > 0$当$β> β_\mathrm{c}$。

英文摘要:

We present a general class of geometric network growth mechanisms by homogeneous attachment in which the links created at a given time $t$ are distributed homogeneously between a new node and the exising nodes selected uniformly. This is achieved by creating links between nodes uniformly distributed in a homogeneous metric space according to a Fermi-Dirac connection probability with inverse temperature $β$ and general time-dependent chemical potential $μ(t)$. The chemical potential limits the spatial extent of newly created links. Using a hidden variable framework, we obtain an analytical expression for the degree sequence and show that $μ(t)$ can be fixed to yield any given degree distributions, including a scale-free degree distribution. Additionally, we find that depending on the order in which nodes appear in the network---its $\textit{history}$---the degree-degree correlation can be tuned to be assortative or disassortative. The effect of the geometry on the structure is investigated through the average clustering coefficient $\langle c \rangle$. In the thermodynamic limit, we identify a phase transition between a random regime where $\langle c \rangle \rightarrow 0$ when $β< β_\mathrm{c}$ and a geometric regime where $\langle c \rangle > 0$ when $β> β_\mathrm{c}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑