当前位置:
X-MOL 学术
›
Random Struct. Algorithms
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
The infinite limit of separable permutations
Random Structures and Algorithms ( IF 0.9 ) Pub Date : 2021-05-20 , DOI: 10.1002/rsa.21014 Ross G. Pinsky 1
Random Structures and Algorithms ( IF 0.9 ) Pub Date : 2021-05-20 , DOI: 10.1002/rsa.21014 Ross G. Pinsky 1
Affiliation
Let denote the uniform probability measure on the set of separable permutations in Sn. Let with an appropriate metric and denote by the compact metric space consisting of functions from to which are injections when restricted to ; that is, if , i ≠ j, then . Extending permutations
by defining , for j > n, we have . We show that converges weakly on to a limiting distribution of regenerative type, which we calculate explicitly.
中文翻译:
可分离排列的无限极限
让表示S n中可分离排列集上的统一概率测度。让与由适当的度量,并且表示包括功能的紧凑度量空间从到时限制到其是注射剂; 也就是说,如果,i ≠ j,则。 通过定义扩展排列,对于j > n,我们有。我们表明,它弱收敛于我们明确计算的再生类型的极限分布。
更新日期:2021-05-20
中文翻译:
可分离排列的无限极限
让表示S n中可分离排列集上的统一概率测度。让与由适当的度量,并且表示包括功能的紧凑度量空间从到时限制到其是注射剂; 也就是说,如果,i ≠ j,则。 通过定义扩展排列,对于j > n,我们有。我们表明,它弱收敛于我们明确计算的再生类型的极限分布。