arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.7018physics.soc-phcond-mat.stat-mech
收藏

与超级加入者一起成长的网络

Growing Networks with Super-Joiners

Ammerah Jabr-Hamdan, Jie Sun, Daniel ben-Avraham

摘要:

我们研究Krapivsky-Redner(KR)网络增长模型,但新节点可以连接到任何数量的现有节点,$m$,从幂律分布$p(m)\sim m^{-α}$。每个$m$新连接仍然如在具有概率重定向$r$(对应于原始KR模型中的度指数$γ_{\rm KR}=1+1/r$)的KR模型中那样执行。连接到任意数量节点的可能性类似于几种设置中更现实的增长类型,例如社交网络、路由器网络和引用网络。在这里,我们专注于在,出,和总的程度分布和程度指数$α$之间的潜在紧张关系,表征新的连接(传出链接),和程度指数$γ_{\rm KR}(r)$由重定向机制决定。

英文摘要:

We study the Krapivsky-Redner (KR) network growth model but where new nodes can connect to any number of existing nodes, $m$, picked from a power-law distribution $p(m)\sim m^{-α}$. Each of the $m$ new connections is still carried out as in the KR model with probability redirection $r$ (corresponding to degree exponent $γ_{\rm KR}=1+1/r$, in the original KR model). The possibility to connect to any number of nodes resembles a more realistic type of growth in several settings, such as social networks, routers networks, and networks of citations. Here we focus on the in-, out-, and total-degree distributions and on the potential tension between the degree exponent $α$, characterizing new connections (outgoing links), and the degree exponent $γ_{\rm KR}(r)$ dictated by the redirection mechanism.

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

↑