arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.00747math.PR
收藏

极值连接网络

Extremal linkage networks

Markus Heydenreich, Christian Hirsch

摘要:

我们展示了复杂的图形属性,如小距离和无标度分布,自然产生的分层图上的强化机制。每个节点被分配一个先验i.i.d.最大稳定分布适应度。适应度决定了节点的吸引力w.r.t.传入边以及传出边的空间范围。对于最大稳定的适应度分布,我们得到了复杂的空间网络,我们称之为极值连接网络。

英文摘要:

We demonstrate how sophisticated graph properties, such as small distances and scale-free degree distributions, arise naturally from a reinforcement mechanism on layered graphs. Every node is assigned an a-priori i.i.d. fitness with max-stable distribution. The fitness determines the node attractiveness w.r.t. incoming edges as well as the spatial range for outgoing edges. For max-stable fitness distributions, we thus obtain complex spatial network, which we coin extremal linkage network.

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

↑