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

随机排列和随机数

Random Permutations and Queues

Alexander Gnedin, Dudley Stark

摘要:

给定一个增长规则,依次构造随机排列的程度增加,随机过程版本的rencontre问题问什么是时间的限制比例的排列没有不动点(单循环)。我们证明了离散时间中餐厅过程(CRP)不存在这个极限。然后,我们考虑相关的嵌入的CRP在连续的时间,从而表明,它确实有这个和其他限制的时间平均值。通过这种嵌入,置换的循环结构可以表示为无限服务器队列的串联。我们使用这种连接来显示如何从排队论的结果可以解释在排列的循环计数的演变。

英文摘要:

Given a growth rule which sequentially constructs random permutations of increasing degree, the stochastic process version of the rencontre problem asks what is the limiting proportion of time that the permutation has no fixed points (singleton cycles). We show that the discrete-time Chinese Restaurant Process (CRP) does not exhibit this limit. We then consider the related embedding of the CRP in continuous time and thereby show that it does have this and other limits of the time averages. By this embedding the cycle structure of the permutation can be represented as a tandem of infinite-server queues. We use this connection to show how results from the queuing theory can be interpreted in terms of the evolution of the cycle counts of permutations.

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

↑