Related papers: Cutoff for biased transpositions

Given a finite, connected graph $G$, the lamplighter chain on $G$ is the lazy random walk $X^\diamond$ on the associated lamplighter graph $G^\diamond={\mathbf Z}_2 \wr G$. The mixing time of the lamplighter chain on the torus ${\mathbf…

We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…

We introduce a variation of strong stationary times for random walks on the symmetric group. Rather than proceed in the usual fashion of accumulating larger and larger blocks of cards which may be in any order, we wait for pairs of cards to…

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is riffle-shuffled exactly one time. Given a value $p\in(0{,}1)\setminus\{\frac12\}$, the riffle shuffle is assumed to be…

In this paper, we study the mixing time of the simple exclusion process with $k$ particles in the line segment $[1, N]$ with conductances $c^{(N)}(x, x+1)_{1\le x<N}$ where $c^{(N)}(x, x+1)>0$ is the rate of swapping the contents of the two…

Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move:…

This paper studies the game of guessing riffle-shuffled cards with complete feedback. A deck of $n$ cards labelled 1 to $n$ is riffle-shuffled once and placed on a table. A player tries to guess the cards from top and is given complete…

We prove an upper bound of $1.5324 n \log n$ for the mixing time of the random-to-random insertion shuffle, improving on the best known upper bound of $2 n \log n$. Our proof is based on the analysis of a non-Markovian coupling.

We consider mixing times for the open asymmetric simple exclusion process (ASEP) at the triple point. We show that the mixing time of the open ASEP on a segment of length $N$ for bias parameter $q$ is of order $N^{3/2+\kappa}$ if $1-q…

The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…

How many shuffles are needed to mix up a deck of cards? This question may be answered in the language of a random walk on the symmetric group, $S_{52}$. This generalises neatly to the study of random walks on finite groups, themselves a…

Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We study some probabilistic and…

We consider tilings of $\mathbb{Z}^2$ by two types of squares. We are interested in the rate of convergence to the stationarity of a natural Markov chain defined for square tilings. The rate of convergence can be represented by the mixing…

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is shelf-shuffled exactly one time. One after the other a single card is drawn from the shuffled deck. The guesser makes has guess…

We consider the simple exclusion process with $k$ particles on a segment of length $N$ performing random walks with transition $p>1/2$ to the right and $q=1-p$ to the left. We focus on the case where the asymmetry in the jump rates…

The thesis consider the mixing of few (3-4) card shuffling as well as of large (52 card) deck. The thesis is showing the limit on the shuffling to homogeneity elaborated in short program; the thesis is in italian.

Let 0<\alpha<1/2. We show that the mixing time of a continuous-time reversible Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of stationary measure at least \alpha of the state space.…

We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…

We analyse a random walk on the ring of integers mod $n$, which at each time point can make an additive `step' or a multiplicative `jump'. When the probability of making a jump tends to zero as an appropriate power of $n$ we prove the…

Sampling uniform simple graphs with power-law degree distributions with degree exponent $\tau\in(2,3)$ is a non-trivial problem. We propose a method to sample uniform simple graphs that uses a constrained version of the configuration model…