arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.3275math.PRmath.CO
收藏

$q$ -通过拟不变性的交换

$q$-exchangeability via quasi-invariance

Alexander Gnedin, Grigori Olshanski

摘要:

对于正的$q\neq1$,引入了无限随机字的$q$ -互换性作为字母置换下的准不变性,并引入了一个特殊的上循环来解释字中的反转.这个框架允许我们扩展$q$ -二进制序列的de Finetti定理的类似物--参见Gnedin和Olshanski [Electron. J. Combin. 16(2009)R78]-一般实值序列。与经典的交换基($q=1$)的情况相反,$\mathbb{R}$上的顺序对于$q$ -类似物起重要作用。遍历$q$ -可交换测度的显式构造涉及通过几何选择的迭代对$\mathbb{N}=\{1,2,...\}$进行随机洗牌。连接建立在$q$ -Pascal金字塔上的瞬态马尔可夫链和伽罗瓦域上的不变随机标志。

英文摘要:

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend the $q$-analog of de Finetti's theorem for binary sequences---see Gnedin and Olshanski [Electron. J. Combin. 16 (2009) R78]---to general real-valued sequences. In contrast to the classical case of exchangeability ($q=1$), the order on $\mathbb{R}$ plays a significant role for the $q$-analogs. An explicit construction of ergodic $q$-exchangeable measures involves random shuffling of $\mathbb{N}=\{1,2,...\}$ by iteration of the geometric choice. Connections are established with transient Markov chains on $q$-Pascal pyramids and invariant random flags over the Galois fields.

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

↑