arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1106.2075cond-mat.stat-mechcs.DMmath.CO
收藏

玻色-爱因斯坦方法研究粒子的随机分划

A Bose-Einstein Approach to the Random Partitioning of an Integer

Thierry Huillet

摘要:

考虑圆周N上的N个等距点。从这个圆上的$N$中随机选择n个点,并向每个这样的点顺时针附加一个整数长度为k的弧。所得到的随机集由随机数量的连通分量组成。问题,如随机覆盖和停车配置的概率的评估,数量和长度的差距得到解决。它们是连续体中提出的类似问题的离散版本。对于每个值的k,渐近结果时,N,N都去无穷大根据两个不同的制度。这个模型可以等效地看作是一个随机划分问题的N个项目到n个收件人。还提供了一个大的典型的球在盒子的方法,给一些洞察到盒子填充量或间距的多重性。后一个模型是具有N个顶点和kn条边的k-最近邻随机图。我们还将简要地考虑在具有N个顶点和n条(出度1)边的随机图模型的上下文中的覆盖问题,这些边的端点不再是邻居。

英文摘要:

Consider N equally-spaced points on a circle of circumference N. Choose at random n points out of $N$ on this circle and append clockwise an arc of integral length k to each such point. The resulting random set is made of a random number of connected components. Questions such as the evaluation of the probability of random covering and parking configurations, number and length of the gaps are addressed. They are the discrete versions of similar problems raised in the continuum. For each value of k, asymptotic results are presented when n,N both go to infinity according to two different regimes. This model may equivalently be viewed as a random partitioning problem of N items into n recipients. A grand-canonical balls in boxes approach is also supplied, giving some insight into the multiplicities of the box filling amounts or spacings. The latter model is a k-nearest neighbor random graph with N vertices and kn edges. We shall also briefly consider the covering problem in the context of a random graph model with N vertices and n (out-degree 1) edges whose endpoints are no more bound to be neighbors.

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

↑