arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.02889cond-mat.dis-nnphysics.comp-ph
收藏

二分z匹配中的相变

Phase transition in the bipartite z-matching

Till Kahlke, Martin Fränzle, Alexander K. Hartmann

摘要:

我们数值研究了二部随机图系综上的最大$z$匹配问题。$z$ -匹配问题描述了两种类型的节点(用户和服务器)之间的匹配,其中每个服务器可以同时为多个$z$用户提供服务。通过使用到标准最大基数匹配的映射,并且因为对于后者存在多项式时间精确算法,我们可以研究多达$10^6$节点的大系统大小。我们测量的容量和能量的最佳匹配。首先,我们确认以前的分析结果的二部正则图。接下来,我们研究了匹配容量的有限大小行为,并发现与标准匹配相同的缩放行为,这表明了问题的普遍性。最后,我们研究了二部Erdens-Rényi随机图的饱和度作为平均度的函数,即,网络是否允许为尽可能多的客户提供服务,即以最佳方式利用服务器。我们发现不饱和和饱和相之间的相变。这些与精确匹配算法的运行时间的强烈变化以及最小程度启发式算法开始失败的点一致。

英文摘要:

We study numerically the maximum $z$-matching problems on ensembles of bipartite random graphs. The $z$-matching problems describes the matching between two types of nodes, users and servers, where each server may serve up to $z$ users at the same time. By using a mapping to standard maximum-cardinality matching, and because for the latter there exists a polynomial-time exact algorithm, we can study large system sizes of up to $10^6$ nodes. We measure the capacity and the energy of the resulting optimum matchings. First, we confirm previous analytical results for bipartite regular graphs. Next, we study the finite-size behaviour of the matching capacity and find the same scaling behaviour as before for standard matching, which indicates the universality of the problem. Finally, we investigate for bipartite Erdős-Rényi random graphs the saturability as a function of the average degree, i.e., whether the network allows as many customers as possible to be served, i.e. exploiting the servers in an optimal way. We find phase transitions between unsaturable and saturable phases. These coincide with a strong change of the running time of the exact matching algorithm, as well with the point where a minimum-degree heuristic algorithm starts to fail.

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

↑