{"title":"群上马尔可夫链双余弦凑合的必要条件和充分条件,以及对随机到顶洗牌的应用","authors":"John Britnell, Mark Wildon","doi":"10.1090/proc/16853","DOIUrl":null,"url":null,"abstract":"<p>Let <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper Q\"> <mml:semantics> <mml:mi>Q</mml:mi> <mml:annotation encoding=\"application/x-tex\">Q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a probability measure on a finite group <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\"application/x-tex\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, and let <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper H\"> <mml:semantics> <mml:mi>H</mml:mi> <mml:annotation encoding=\"application/x-tex\">H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a subgroup of <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\"application/x-tex\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. We show that a necessary and sufficient condition for the random walk driven by <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper Q\"> <mml:semantics> <mml:mi>Q</mml:mi> <mml:annotation encoding=\"application/x-tex\">Q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> on <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\"application/x-tex\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> to induce a Markov chain on the double coset space <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper H minus upper G slash upper H\"> <mml:semantics> <mml:mrow> <mml:mi>H</mml:mi> <mml:mi mathvariant=\"normal\">∖</mml:mi> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>H</mml:mi> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">H\\backslash G/H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is that <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper Q left-parenthesis g upper H right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>Q</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>g</mml:mi> <mml:mi>H</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">Q(gH)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is constant as <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"g\"> <mml:semantics> <mml:mi>g</mml:mi> <mml:annotation encoding=\"application/x-tex\">g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ranges over any double coset of <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper H\"> <mml:semantics> <mml:mi>H</mml:mi> <mml:annotation encoding=\"application/x-tex\">H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\"application/x-tex\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. We obtain this result as a corollary of a more general theorem on the double cosets <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper H minus upper G slash upper K\"> <mml:semantics> <mml:mrow> <mml:mi>H</mml:mi> <mml:mi mathvariant=\"normal\">∖</mml:mi> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>K</mml:mi> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">H \\backslash G / K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper K\"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding=\"application/x-tex\">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> an arbitrary subgroup of <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper G\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\"application/x-tex\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. As an application we study a variation on the <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"r\"> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding=\"application/x-tex\">r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-top to random shuffle which we show induces an irreducible, recurrent, reversible and ergodic Markov chain on the double cosets of <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper S normal y normal m Subscript r Baseline times normal upper S normal y normal m Subscript n minus r\"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow> <mml:mi mathvariant=\"normal\">S</mml:mi> <mml:mi mathvariant=\"normal\">y</mml:mi> <mml:mi mathvariant=\"normal\">m</mml:mi> </mml:mrow> <mml:mi>r</mml:mi> </mml:msub> <mml:mo>×</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant=\"normal\">S</mml:mi> <mml:mi mathvariant=\"normal\">y</mml:mi> <mml:mi mathvariant=\"normal\">m</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>−</mml:mo> <mml:mi>r</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">\\mathrm {Sym}_r \\times \\mathrm {Sym}_{n-r}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper S normal y normal m Subscript n\"> <mml:semantics> <mml:msub> <mml:mrow> <mml:mi mathvariant=\"normal\">S</mml:mi> <mml:mi mathvariant=\"normal\">y</mml:mi> <mml:mi mathvariant=\"normal\">m</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> <mml:annotation encoding=\"application/x-tex\">\\mathrm {Sym}_n</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. The transition matrix of the induced walk has remarkable spectral properties: we find its invariant distribution and its eigenvalues and hence determine its rate of convergence.</p>","PeriodicalId":20696,"journal":{"name":"Proceedings of the American Mathematical Society","volume":"48 1","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2024-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle\",\"authors\":\"John Britnell, Mark Wildon\",\"doi\":\"10.1090/proc/16853\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Let <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper Q\\\"> <mml:semantics> <mml:mi>Q</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">Q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a probability measure on a finite group <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, and let <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper H\\\"> <mml:semantics> <mml:mi>H</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a subgroup of <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. We show that a necessary and sufficient condition for the random walk driven by <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper Q\\\"> <mml:semantics> <mml:mi>Q</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">Q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> on <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> to induce a Markov chain on the double coset space <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper H minus upper G slash upper H\\\"> <mml:semantics> <mml:mrow> <mml:mi>H</mml:mi> <mml:mi mathvariant=\\\"normal\\\">∖</mml:mi> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>H</mml:mi> </mml:mrow> <mml:annotation encoding=\\\"application/x-tex\\\">H\\\\backslash G/H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is that <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper Q left-parenthesis g upper H right-parenthesis\\\"> <mml:semantics> <mml:mrow> <mml:mi>Q</mml:mi> <mml:mo stretchy=\\\"false\\\">(</mml:mo> <mml:mi>g</mml:mi> <mml:mi>H</mml:mi> <mml:mo stretchy=\\\"false\\\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\\\"application/x-tex\\\">Q(gH)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is constant as <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"g\\\"> <mml:semantics> <mml:mi>g</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">g</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ranges over any double coset of <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper H\\\"> <mml:semantics> <mml:mi>H</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">H</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. We obtain this result as a corollary of a more general theorem on the double cosets <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper H minus upper G slash upper K\\\"> <mml:semantics> <mml:mrow> <mml:mi>H</mml:mi> <mml:mi mathvariant=\\\"normal\\\">∖</mml:mi> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>K</mml:mi> </mml:mrow> <mml:annotation encoding=\\\"application/x-tex\\\">H \\\\backslash G / K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper K\\\"> <mml:semantics> <mml:mi>K</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">K</mml:annotation> </mml:semantics> </mml:math> </inline-formula> an arbitrary subgroup of <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"upper G\\\"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. As an application we study a variation on the <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"r\\\"> <mml:semantics> <mml:mi>r</mml:mi> <mml:annotation encoding=\\\"application/x-tex\\\">r</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-top to random shuffle which we show induces an irreducible, recurrent, reversible and ergodic Markov chain on the double cosets of <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"normal upper S normal y normal m Subscript r Baseline times normal upper S normal y normal m Subscript n minus r\\\"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mrow> <mml:mi mathvariant=\\\"normal\\\">S</mml:mi> <mml:mi mathvariant=\\\"normal\\\">y</mml:mi> <mml:mi mathvariant=\\\"normal\\\">m</mml:mi> </mml:mrow> <mml:mi>r</mml:mi> </mml:msub> <mml:mo>×</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant=\\\"normal\\\">S</mml:mi> <mml:mi mathvariant=\\\"normal\\\">y</mml:mi> <mml:mi mathvariant=\\\"normal\\\">m</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>−</mml:mo> <mml:mi>r</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> <mml:annotation encoding=\\\"application/x-tex\\\">\\\\mathrm {Sym}_r \\\\times \\\\mathrm {Sym}_{n-r}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> in <inline-formula content-type=\\\"math/mathml\\\"> <mml:math xmlns:mml=\\\"http://www.w3.org/1998/Math/MathML\\\" alttext=\\\"normal upper S normal y normal m Subscript n\\\"> <mml:semantics> <mml:msub> <mml:mrow> <mml:mi mathvariant=\\\"normal\\\">S</mml:mi> <mml:mi mathvariant=\\\"normal\\\">y</mml:mi> <mml:mi mathvariant=\\\"normal\\\">m</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> <mml:annotation encoding=\\\"application/x-tex\\\">\\\\mathrm {Sym}_n</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. The transition matrix of the induced walk has remarkable spectral properties: we find its invariant distribution and its eigenvalues and hence determine its rate of convergence.</p>\",\"PeriodicalId\":20696,\"journal\":{\"name\":\"Proceedings of the American Mathematical Society\",\"volume\":\"48 1\",\"pages\":\"\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the American Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1090/proc/16853\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the American Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1090/proc/16853","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
设 Q Q 是有限群 G G 上的概率度量,设 H H 是 G G 的一个子群。我们证明,由 Q Q 在 G G 上驱动的随机游走在双余弦空间 H ∖ G / H H\backslash G/H 上诱发马尔科夫链的必要条件和充分条件是,Q ( g H ) Q(gH) 随着 g g 在 G G 中 H H 的任何双余弦上的范围而恒定。我们得到的这个结果是一个关于双余集 H ∖ G / K H\backslash G / K 的更一般的定理的推论,即 K K 是 G G 的一个任意子群。作为一个应用,我们研究了 r r -top 到随机洗牌的变体,我们证明它在 S y m n \mathrm {Sym}_n 的 S y m r × S y m n - r \mathrm {Sym}_r \times \mathrm {Sym}_{n-r} 的双余弦上诱导了一个不可还原、循环、可逆和遍历的马尔可夫链。诱导行走的过渡矩阵具有显著的频谱特性:我们可以找到它的不变分布和特征值,从而确定它的收敛速度。
A necessary and sufficient condition for double coset lumping of Markov chains on groups with an application to the random to top shuffle
Let QQ be a probability measure on a finite group GG, and let HH be a subgroup of GG. We show that a necessary and sufficient condition for the random walk driven by QQ on GG to induce a Markov chain on the double coset space H∖G/HH\backslash G/H is that Q(gH)Q(gH) is constant as gg ranges over any double coset of HH in GG. We obtain this result as a corollary of a more general theorem on the double cosets H∖G/KH \backslash G / K for KK an arbitrary subgroup of GG. As an application we study a variation on the rr-top to random shuffle which we show induces an irreducible, recurrent, reversible and ergodic Markov chain on the double cosets of Symr×Symn−r\mathrm {Sym}_r \times \mathrm {Sym}_{n-r} in Symn\mathrm {Sym}_n. The transition matrix of the induced walk has remarkable spectral properties: we find its invariant distribution and its eigenvalues and hence determine its rate of convergence.
期刊介绍:
All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are.
This journal is devoted to shorter research articles (not to exceed 15 printed pages) in all areas of pure and applied mathematics. To be published in the Proceedings, a paper must be correct, new, and significant. Further, it must be well written and of interest to a substantial number of mathematicians. Piecemeal results, such as an inconclusive step toward an unproved major theorem or a minor variation on a known result, are in general not acceptable for publication. Longer papers may be submitted to the Transactions of the American Mathematical Society. Published pages are the same size as those generated in the style files provided for AMS-LaTeX.