Related papers: On multiplicative Chung--Diaconis--Graham process

Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X* associated with X and Z is the random walk on the wreath…

The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…

Let $(X, Y) = (X_n, Y_n)_{n \geq 1}$ be the output process generated by a hidden chain $Z = (Z_n)_{n \geq 1}$, where $Z$ is a finite state, aperiodic, time homogeneous, and irreducible Markov chain. Let $LC_n$ be the length of the longest…

We study a discrete-time Markov process $X_n\in\mathbb{R}^d$, for which the distribution of the future increments depends only on the relative ranking of its components (descending order by value). We endow the process with a…

We consider the recursion $X_{n+1}=\sum_{i=0}^n \epsilon_{n,i}X_{n-i}$, where $\epsilon_{n,i}$ are i.i.d. (Bernoulli) random variables taking values in $\{-1,1\}$, and $X_0=1$, $X_{-j}=0$ for $j>0$. We prove that almost surely, $n^{-1}\log…

We extend the conductance and canonical paths methods to the setting of general finite Markov chains, including non-reversible non-lazy walks. The new path method is used to show that a known bound for mixing time of a lazy walk on a Cayley…

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical…

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

We consider nearest neighbor weighted random walks on the $d$-dimensional box $[n]^d$ that are governed by some function $g:[0,1] \ra [0,\iy)$, by which we mean that standing at $x$, a neighbor $y$ of $x$ is picked at random and the walk…

We study Markov chains generated by iterated Lipschitz functions systems with possibly place dependent probabilities. Under general conditions, we prove uniqueness of the invariant probability measure for the associated Markov chain, by…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

Let $\Gamma$ be a graph and $P$ be a reversible random walk on $\Gamma$. From the $L^2$ analyticity of the Markov operator $P$, we deduce that an iterate of odd exponent of $P$ is `lazy', that is there exists an integer $k$ such that the…

New results on conditional joint probability distributions of first exit times are presented for a continuous-time stochastic process defined as the mixture of Markov jump processes moving at different speeds on the same finite state space,…

We study the problem of generating a sample from the stationary distribution of a Markov chain, given a method to simulate the chain. We give an approximation algorithm for the case of a random walk on a regular graph with n vertices that…

We prove a theorem that reduces bounding the mixing time of a card shuffle to verifying a condition that involves only triplets of cards. Then we use it to analyze a classic model of card shuffling. In 1988, Diaconis introduced the…

Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…

We propose a Markov chain Monte Carlo (MCMC) algorithm based on third-order Langevin dynamics for sampling from distributions with log-concave and smooth densities. The higher-order dynamics allow for more flexible discretization schemes,…

We study a Markov chain with very different mixing rates depending on how mixing is measured. The chain is the "Burnside process on the hypercube $C_2^n$." Started at the all-zeros state, it mixes in a bounded number of steps, no matter how…