随机漫步和齐次空间上的切换随机漫步

IF 0.9 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Combinatorics, Probability & Computing Pub Date : 2021-10-19 DOI:10.1017/s0963548322000311

Elvira Moreno, Mauricio Velasco

{"title":"随机漫步和齐次空间上的切换随机漫步","authors":"Elvira Moreno, Mauricio Velasco","doi":"10.1017/s0963548322000311","DOIUrl":null,"url":null,"abstract":"We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group $G$ . We introduce the switched random walk determined by a finite set of probability distributions on $G$ , prove that its long-term behaviour is determined by the Fourier joint spectral radius of the distributions, and give Hermitian sum-of-squares algorithms for the effective estimation of this quantity.","PeriodicalId":10513,"journal":{"name":"Combinatorics, Probability & Computing","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2021-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On random walks and switched random walks on homogeneous spaces\",\"authors\":\"Elvira Moreno, Mauricio Velasco\",\"doi\":\"10.1017/s0963548322000311\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group $G$ . We introduce the switched random walk determined by a finite set of probability distributions on $G$ , prove that its long-term behaviour is determined by the Fourier joint spectral radius of the distributions, and give Hermitian sum-of-squares algorithms for the effective estimation of this quantity.\",\"PeriodicalId\":10513,\"journal\":{\"name\":\"Combinatorics, Probability & Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorics, Probability & Computing\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1017/s0963548322000311\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorics, Probability & Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/s0963548322000311","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

我们证明了有限群$G$上由概率分布决定的齐次空间上随机游动的新的混合率估计。我们引入了由$G$上的一组有限概率分布决定的开关随机漫步，证明了它的长期行为是由分布的傅里叶联合谱半径决定的，并给出了有效估计这个量的厄米平方和算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On random walks and switched random walks on homogeneous spaces

We prove new mixing rate estimates for the random walks on homogeneous spaces determined by a probability distribution on a finite group $G$ . We introduce the switched random walk determined by a finite set of probability distributions on $G$ , prove that its long-term behaviour is determined by the Fourier joint spectral radius of the distributions, and give Hermitian sum-of-squares algorithms for the effective estimation of this quantity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Combinatorics, Probability & Computing 数学-计算机：理论方法

CiteScore

2.40

自引率

11.10%

发文量

审稿时长

6-12 weeks

期刊介绍： Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.