arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0406094math.PRcs.DSmath.CO
收藏

加法Marcus-Lushnikov过程和Union-Find算法的合并代价

Merging costs for the additive Marcus-Lushnikov process, and Union-Find algorithms

Philippe Chassaing, Regine Marchand

摘要:

从具有尺寸为1的$n$颗粒的单分散构型开始,添加剂Marcus-Lushnikov过程发展直到其达到其最终状态(具有质量$n$的独特颗粒)。在其演化的每一个$n-1$步骤中,都会产生合并成本,该合并成本取决于所涉及的两个粒子的大小以及独立的随机因子。本文论述了渐近行为的累积成本的$k$次聚类,在各种制度下的$(n,k)$,与应用的研究联盟-查找算法。

英文摘要:

Starting with a monodisperse configuration with $n$ size-1 particles, an additive Marcus-Lushnikov process evolves until it reaches its final state (a unique particle with mass $n$). At each of the $n-1$ steps of its evolution, a merging cost is incurred, that depends on the sizes of the two particles involved, and on an independent random factor. This paper deals with the asymptotic behaviour of the cumulated costs up to the $k$th clustering, under various regimes for $(n,k)$, with applications to the study of Union--Find algorithms.

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

↑