Open AccessRandom walks on Cayley graphs of complex reflection groups
Author(s) -
Maksim Vaskouski
Publication year - 2021
Publication title -
žurnal belorusskogo gosudarstvennogo universiteta. matematika, informatika/žurnal belorusskogo gosudarstvennogo universiteta. matematika, informatika
Language(s) - English
Resource type - Journals
eISSN - 2617-3956
pISSN - 2520-6508
DOI - 10.33581/2520-6508-2021-3-51-56
Subject(s) - cayley graph , isoperimetric inequality , mathematics , random walk , reflection (computer programming) , conjecture , combinatorics , constructive , logarithm , order (exchange) , discrete mathematics , mathematical analysis , graph , computer science , process (computing) , statistics , finance , economics , programming language , operating system
Asymptotic properties of random walks on minimal Cayley graphs of complex reflection groups are investigated. The main result of the paper is theorem on fast mixing for random walks on Cayley graphs of complex reflection groups. Particularly, bounds of diameters and isoperimetric constants, a known result on fast fixing property for expander graphs play a crucial role to obtain the main result. A constructive way to prove a special case of Babai’s conjecture on logarithmic order of diameters for complex reflection groups is proposed. Basing on estimates of diameters and Cheeger inequality, there is obtained a non-trivial lower bound for spectral gaps of minimal Cayley graphs on complex reflection groups.