On Kazhdan Constants and Mixing of Random Walks
نویسنده
چکیده
Let G be a group with Kazhdan’s property (T), and let S be a transitive generating set (there exists a group H ⊂ Aut(G) which acts transitively on S.) In this paper we relate two definitions of the Kazhdan constant and the eigenvalue gap in this case. Applications to various random walks on groups, and the product replacement random algorithm, are also presented.
منابع مشابه
Mixing of the Upper Triangular Matrix Walk
We study a natural random walk over the upper triangular matrices, with entries in the field Z2, generated by steps which add row i + 1 to row i. We show that the mixing time of the lazy random walk is O(n) which is optimal up to constants. Our proof makes key use of the linear structure of the group and extends to walks on the upper triangular matrices over the fields Zq for q prime.
متن کاملDiffusion constants and martingales for senile random walks
We derive diffusion constants and martingales for senile random walks with the help of a time-change. We provide direct computations of the diffusion constants for the time-changed walks. Alternatively, the values of these constants can be derived from martingales associated with the timechanged walks. Using an inverse time-change, the diffusion constants for senile random walks are then obtain...
متن کاملRandom walks on dynamical percolation: mixing times, mean squared displacement and hitting times
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate μ while at the same time a random walker moves on G at rate 1 but only along edges which are open. On the d-dimensional torus with side length n, we prove that in the subcritical regime, the mixing times for both the full system and the ...
متن کاملRandom walks on hypergroup of conics in finite fields
In this paper we study random walks on the hypergroup of conics in finite fields. We investigate the behavior of random walks on this hypergroup, the equilibrium distribution and the mixing times. We use the coupling method to show that the mixing time of random walks on hypergroup of conics is only linear. Mathematics Subject Classifications: 60D05, 11A99. Keywoords: random walks, hypergroups,...
متن کاملOn the limiting velocity of random walks in mixing random environment
We consider random walks in strong-mixing random Gibbsian environments in Z, d ≥ 2. Based on regeneration arguments, we will first provide an alternative proof of Rassoul-Agha’s conditional law of large numbers (CLLN) for mixing environment [8]. Then, using coupling techniques, we show that there is at most one nonzero limiting velocity in high dimensions (d ≥ 5).
متن کامل