Corpus ID: 235458272

On multiplicative Chung--Diaconis--Graham process

  title={On multiplicative Chung--Diaconis--Graham process},
  author={I. Shkredov},
We study the lazy Markov chain on Fp defined as Xn+1 = Xn with probability 1/2 and Xn+1 = f(Xn) · εn+1, where εn are random variables distributed uniformly on {γ, γ−1}, γ is a primitive root and f(x) = x x−1 or f(x) = ind(x). Then we show that the mixing time of Xn is exp(O(log p/ log log p)). Also, we obtain an application to an additive–combinatorial question concerning a certain Sidon–type family of sets. 


A lower bound for the Chung-Diaconis-Graham random process
Chung, Diaconis, and Graham considered random processes of the form X n+1 = a n X n + b n (mod p) where p is odd, X 0 = 0, an = 2 always, and b n are i.i.d. for n = 0, 1, 2,.... In this paper, weExpand
Generating Uniform Random Vectors
In this paper, we study the rate of convergence of the Markov chain Xn+1=AXn+bn mod p, where A is an integer matrix with nonzero integer eigenvalues and {bn}n is a sequence of independent andExpand
Random Processes of the Form Xn+1 = anXn + bn(mod p)where bn takes on a Single Value
This paper studies random processes of the form X n +1 = a n X n + b n (mod p) where b n has only one possible value and a n is o or 1 with probability l/2 each. For values of p satisfying certainExpand
Markov chains and mixing times
For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities.Expand
Laplacians and the Cheeger Inequality for Directed Graphs
Abstract.We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We thenExpand
Random Walks Arising in Random Number Generation
On considere la forme generale des generateurs de nombres aleatoires X n+1 =aX n +b(mod. p). Differents schemas existent pour combiner ces generateurs. Dans un schema, a et b sont eux-memes choisisExpand
On asymptotic formulae in some sum-product questions
In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well asExpand
Uniform expansion bounds for Cayley graphs of SL2(Fp)
We prove that Cayley graphs of SL2(Fp) are expanders with respect to the projection of any fixed elements in SL(2, Z) generating a non-elementary subgroup, and with respect to generators chosen atExpand
Modular hyperbolas and bilinear forms of Kloosterman sums.
In this paper we study incidences for hyperbolas in $\mathbf{F}_p$ and show how linear sum--product methods work for such curves. As an application we give a purely combinatorial proof of aExpand
Extremal problems in discrete geometry
Several theorems involving configurations of points and lines in the Euclidean plane are established, including one that shows that there is an absolute constantc3 so that whenevern points are placed in the plane not all on the same line, then there is one point on more thanc3n of the lines determined by then points. Expand