Some results concerning the rates of convergence of random walks on finite group

1998 ◽  
Vol 37 (1) ◽  
pp. 15-17 ◽  
Author(s):  
Jack J. Dai
10.37236/1322 ◽  
1996 ◽  
Vol 4 (2) ◽  
Author(s):  
F. R. K. Chung ◽  
R. L. Graham

We analyze a certain random walk on the cartesian product $G^n$ of a finite group $G$ which is often used for generating random elements from $G$. In particular, we show that the mixing time of the walk is at most $c_r n^2 \log n$ where the constant $c_r$ depends only on the order $r$ of $G$.


2004 ◽  
Vol 41 (1) ◽  
pp. 101-126
Author(s):  
B. Székely ◽  
T. Szabados

The aim of this paper is to represent any continuous local martingale as an almost sure limit of a nested sequence of simple, symmetric random walk, time changed by a discrete quadratic variation process. One basis of this is a similar construction of Brownian motion. The other major tool is a representation of continuous local martingales given by Dambis, Dubins and Schwarz (DDS) in terms of Brownian motion time-changed by the quadratic variation. Rates of convergence (which are conjectured to be nearly optimal in the given setting) are also supplied. A necessary and sufficient condition for the independence of the random walks and the discrete time changes or equivalently, for the independence of the DDS Brownian motion and the quadratic variation is proved to be the symmetry of increments of the martingale given the past, which is a reformulation of an earlier result by Ocone [8].


10.37236/1284 ◽  
1996 ◽  
Vol 3 (2) ◽  
Author(s):  
Phil Hanlon

Let $B$ be a Ferrers board, i.e., the board obtained by removing the Ferrers diagram of a partition from the top right corner of an $n\times n$ chessboard. We consider a Markov chain on the set $R$ of rook placements on $B$ in which you can move from one placement to any other legal placement obtained by switching the columns in which two rooks sit. We give sharp estimates for the rate of convergence of this Markov chain using spectral methods. As part of this analysis we give a complete combinatorial description of the eigenvalues of the transition matrix for this chain. We show that two extremes cases of this Markov chain correspond to random walks on groups which are analyzed in the literature. Our estimates for rates of convergence interpolate between those two results.


1997 ◽  
Vol 6 (1) ◽  
pp. 49-56 ◽  
Author(s):  
ANDREW S. GREENHALGH

A model for a random random-walk on a finite group is developed where the group elements that generate the random-walk are chosen uniformly and with replacement from the group. When the group is the d-cube Zd2, it is shown that if the generating set is size k then as d → ∞ with k − d → ∞ almost all of the random-walks converge to uniform in k ln (k/(k − d))/4+ρk steps, where ρ is any constant satisfying ρ > −ln (ln 2)/4.


Author(s):  
Mikhail Menshikov ◽  
Serguei Popov ◽  
Andrew Wade
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document