arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.02429cond-mat.stat-mech
收藏

选择聚集动力学

Kinetics of Aggregation with Choice

E. Ben-Naim, P. L. Krapivsky

摘要:

我们推广普通的聚合过程,以允许选择。在普通聚合中,两个随机簇合并并形成更大的聚合。在我们的选择实现中,随机选择一个目标聚类和两个候选聚类,目标聚类与两个候选聚类中较大的一个合并。我们研究了长时间的渐近行为,发现在普通聚集,尺寸密度坚持标准的标度形式。然而,有选择的聚合表现出一些新的特点。首先,最小的集群的密度表现出异常的标度。第二,无论是小尺寸和大尺寸的密度尾部人口过剩,在牺牲密度中等大小的集群。我们还研究了互补的情况下,较小的候选集群参与聚集过程中,并找到丰富的中等集群的代价小和大集群。此外,我们调查聚合过程中的多个候选集群之间的选择,和一个对称的实现,其中的选择是两对集群之间。

英文摘要:

We generalize the ordinary aggregation process to allow for choice. In ordinary aggregation, two random clusters merge and form a larger aggregate. In our implementation of choice, a target cluster and two candidate clusters are randomly selected, and the target cluster merges with the larger of the two candidate clusters. We study the long-time asymptotic behavior, and find that as in ordinary aggregation, the size density adheres to the standard scaling form. However, aggregation with choice exhibits a number of novel features. First, the density of the smallest clusters exhibits anomalous scaling. Second, both the small-size and the large-size tails of the density are overpopulated, at the expense of the density moderate-size clusters. We also study the complementary case where the smaller candidate clusters participates in the aggregation process, and find abundance of moderate clusters at the expense of small and large clusters. Additionally, we investigate aggregation processes with choice among multiple candidate clusters, and a symmetric implementation where the choice is between two pairs of clusters.

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

↑