当前位置: 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
Affiliation  

Let urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0001 denote the uniform probability measure on the set of separable permutations in Sn. Let urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0002 with an appropriate metric and denote by urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0003 the compact metric space consisting of functions urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0004 from urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0005 to urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0006 which are injections when restricted to urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0007; that is, if urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0008, i ≠ j, then urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0009. Extending permutations urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0010 by defining urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0011, for j > n, we have urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0012. We show that urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0013 converges weakly on urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0014 to a limiting distribution of regenerative type, which we calculate explicitly.

中文翻译:

可分离排列的无限极限

urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0001表示S n中可分离排列集上的统一概率测度。让urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0002与由适当的度量,并且表示urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0003包括功能的紧凑度量空间urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0004urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0005urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0006时限制到其是注射剂urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0007; 也就是说,如果urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0008i  ≠  j,则urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0009urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0010 通过定义扩展排列urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0011,对于j  >  n,我们有urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0012。我们表明,它urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0013弱收敛于urn:x-wiley:rsa:media:rsa21014:rsa21014-math-0014我们明确计算的再生类型的极限分布。
更新日期:2021-05-20
down
wechat
bug