Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
167 views

How to choose N policemen positions to catch a drunk driver in the most effective way (on a Cayley graph of a finite group)?

Consider a Cayley graph of some big finite group. Consider random walk on such a graph - think of it as drunk driver. Fix some number $N$ which is much smaller than group size. Question 1: How to ...
Alexander Chervov's user avatar
2 votes
0 answers
202 views

Random walk on a finite group, converging modulo a function

Let $G$ be a finite group, and let $Q$ be a probability measure on $G$. Suppose that $Q$, as a function on $G$, is supported on a conjugacy class $C$. We denote by $Q^{*k}$ the $k$-fold convolution of ...
Ofir Gorodetsky's user avatar