arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1904.11208physics.soc-phcs.SI
收藏

具有相同度分布的随机图系综

An ensemble of random graphs with identical degree distribution

Fei Ma, Xiaoming Wang, Ping Wang

摘要:

度分布,或称度序列,是研究复杂网络的重要测度之一,并已得到了一些著名的结果。与此相反,本文中,我们报告了一个事实,即两个任意选择的网络具有相同的度分布可以有完全不同的其他拓扑结构,如直径,生成树数,皮尔逊相关系数等。除此之外,对于给定的度分布(如这里讨论的指数为$γ=3$的幂律分布),我们可以合理地问有多少网络模型具有这样的约束。为此,我们用$P(k)\sim k^{-γ}$($γ=3$)生成此类随机图的系综,表示为图空间$\mathcal{N}(p,q,t)$,其中概率参数$p$和$q$在$p+q=1$上保持不变,并间接表明$\mathcal{N}(p,q,t)$的基数似乎在热力学极限内足够大,即,通过改变$p$和$q$的值,可获得$N\rightarrow\infty$。从理论上讲,给定一个超小常数$p_{c}$,也许只有图模型$N(1,0,t)$是小世界的,其他的都不是直径的。然后,我们研究了两个确定图模型的生成树数,得到了其他成员的生成树数的上界和下界。同时,对于任意的$p(\neq1)$,我们证明了图模型$N(p,q,t)$随时间确实经历了两个相变,即,由非突变型开始,突然进入突变区,然后逐渐收敛到初始位置(非突变点)。其中,建立了一个“空”图模型。

英文摘要:

Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast, in this paper, we report a fact that two arbitrarily chosen networks with identical degree distribution can have completely different other topological structure, such as diameter, spanning trees number, pearson correlation coefficient, and so forth. Besides that, for a given degree distribution (as power-law distribution with exponent $γ=3$ discussed here), it is reasonable to ask how many network models with such a constraint we can have. To this end, we generate an ensemble of this kind of random graphs with $P(k)\sim k^{-γ}$ ($γ=3$), denoted as graph space $\mathcal{N}(p,q,t)$ where probability parameters $p$ and $q$ hold on $p+q=1$, and indirectly show the cardinality of $\mathcal{N}(p,q,t)$ seems to be large enough in the thermodynamics limit, i.e., $N\rightarrow\infty$, by varying values of $p$ and $q$. From the theoretical point of view, given an ultrasmall constant $p_{c}$, perhaps only graph model $N(1,0,t)$ is small-world and other are not in terms of diameter. And then, we study spanning trees number on two deterministic graph models and obtain both upper bound and lower bound for other members. Meanwhile, for arbitrary $p(\neq1)$, we prove that graph model $N(p,q,t)$ does go through two phase transitions over time, i.e., starting by non-assortative pattern and then suddenly going into disassortative region, and gradually converging to initial place (non-assortative point). Among of them, one "null" graph model is built.

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

↑