On the Likelihood of Comparability in Bruhat Order

Bruhat序中的可比性

Comparability in Bruhat orders

研究确定了随机排列在弱Bruhat序中可比的概率精确渐进行为，并改进了强Bruhat序可比性的下界。

The weak Bruhat order for random walks on Coxeter groups

We show that for the simple random walk on a Coxeter group generated by the Coxeter generators and identity, the likelihoods of being at any pair of states respect the weak Bruhat order. That is, after any number of steps, the most likely element is the identity, probabilities decrease along any geodesic from the identity, and the least likely element is the longest element, if the group is finite. The result remains true when different generators have different probabilities, so long as the identity is at least as likely as any other.