Related papers: Mixing times via super-fast coupling
We present an upper bound on the mixing rate of the equilibrium state of a dynamical systems defined by the one-sided shift and a non H\"{o}lder potential of summable variations. The bound follows from an estimation of the relaxation speed…
Recently, Diaconis, Ram and I created Markov chains out of the coproduct-then-product operator on combinatorial Hopf algebras. These chains model the breaking and recombining of combinatorial objects. Our motivating example was the…
We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary…
In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\em semi-regular} degree…
This paper studies the asymptotic behavior of processes with switching. More precisely, the stability under fast switching for diffusion processes and discrete state space Markovian processes is considered. The proofs are based on…
In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, usually in form of graph measures. A much studied class of problems targets uniform sampling of…
We obtain moment and Gaussian bounds for general Lipschitz functions evaluated along the sample path of a Markov chain. We treat Markov chains on general (possibly unbounded) state spaces via a coupling method. If the first moment of the…
We reconsider a recently published algorithm (Dalkilic et al.) for merging lists by way of the perfect shuffle. The original publication gave only experimental results which, although consistent with linear execution time on the samples…
For positive integers $k$ and $n$, the shuffle group $G_{k,kn}$ is generated by the $k!$ permutations of a deck of $kn$ cards performed by cutting the deck into $k$ piles with $n$ cards in each pile, and then perfectly interleaving these…
We give a set of equivalent conditions for a potential on a Countable Markov Shift to have strong positive recurrence, which is also equivalent to having exponential decay of correlations. A key ingredient of our proofs is quantifying how…
Ge and Stefankovic have recently introduced a novel two-variable graph polynomial. When specialised to a bipartite graphs G and evaluated at the point (1/2,1) this polynomial gives the number of independent sets in the graph. Inspired by…
Bifurcations in a system of coupled maps are investigated. Using symbolic dynamics it is proven that for coupled shift maps the well known space--time--mixing attractor becomes unstable at a critical coupling strength in favour of a…
In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The…
Inspired by a common technique for shuffling a deck of cards on a table without riffling, we formalize the pile shuffle and investigate its capabilities as a sorting device. Our study is novel in that we consider pile shuffle in three…
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 irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
In this paper, several fundamental facts, especially the existence and uniqueness of an absolutely continuous ergodic measure with an exponential mixing rate, are derived for smooth expanding circle maps. Although the results are classical,…
The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$. In this paper we investigate what happens when the random…
We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…
We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffled together.