Related papers: Mixing time for the Repeated Balls into Bins dynam…
Consider a Markov chain with finite state space and suppose you wish to change time replacing the integer step index $n$ with a random counting process $N(t)$. What happens to the mixing time of the Markov chain? We present a partial reply…
Consider a balls-in-bins process in which each new ball goes into a given bin with probability proportional to f(n), where n is the number of balls currently in the bin and f is a fixed positive function. It is known that these so-called…
Consider a system of \(n\) players in which each initially starts on a different team. At each time step, we select an individual winner and an individual loser randomly and the loser joins the winner's team. The resulting Markov chain and…
Balls-and-bins games have been a wildly successful tool for modeling load balancing problems. In this paper, we study a new scenario, which we call the ball recycling game, defined as follows: Throw m balls into n bins i.i.d. according to a…
Balls-in-bins models describe a random sequential allocation of infinitely many balls into a finite number of bins. In these models a ball is placed into a bin with probability proportional to a given function (feedback function), which…
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application…
We investigate the mixing properties of a finite Markov chain in random environment defined as a mixture of a deterministic chain and a chain whose state space has been permuted uniformly at random. This work is the counterpart of a…
Mixing of finite time-homogeneous Markov chains is well understood nowadays, with a rich set of techniques to estimate their mixing time. In this paper, we study the mixing time of random walks in dynamic random environments. To that end,…
We present results relating mixing times to the intersection time of branching random walk (BRW) in which the logarithm of the expected number of particles grows at rate of the spectral-gap $\mathrm{gap}$ . This is a finite state space…
Consider a model of $N$ independent, increasing $\mathbb{N}_0$-valued processes, with random, independent waiting times between jumps. It is known that there is either an emergent `leader', in which a single process possesses the maximal…
We develop Markov chain mixing time estimates for a class of Markov chains with restricted transitions. We assume transitions may occur along a cycle of $n$ nodes and on $n^\gamma$ additional edges, where $\gamma < 1$. We find that the…
We consider a Markov chain on invertible $n\times n$ matrices with entries in $\mathbb{Z}_2$ which moves by picking an ordered pair of distinct rows and add the first one to the other, modulo $2$. We establish a logarithmic Sobolev…
In this paper, we develop some matrix Poisson's equations satisfied by the mean and variance of the mixing time in an irreducible positive-recurrent discrete-time Markov chain with infinitely-many levels, and provide a computational…
We present a Markov chain example where non-reversibility and an added edge jointly improve mixing time: when a random edge is added to a cycle of $n$ vertices and a Markov chain with a drift is introduced, we get mixing time of…
Motivated by applications in telecommunications, computer scienceand physics, we consider a discrete-time Markov process withrestart. At each step the process eitherwith a positive probability restarts from a given distribution, orwith the…
We consider the return times dynamics to Bowen balls for continuous maps on metric spaces which have invariant probability measures with certain mixing properties. These mixing properties are satisfied for instance by systems that allow…
Many finite-state reversible Markov chains can be naturally decomposed into "projection" and "restriction" chains. In this paper we provide bounds on the total variation mixing times of the original chain in terms of the mixing properties…
In this paper we study a one-parameter family of attractive reversible nearest particle system on a finite interval. As the length of the interval increases, the time that the nearest particle system first hits the empty set increases in…
Activated Random Walk (ARW) is an interacting particle system on the $d$-dimensional lattice $\mathbb{Z}^d$. On a finite subset $V \subset \mathbb{Z}^d$ it defines a Markov chain on $\{0,1\}^V$. We prove that when $V$ is a Euclidean ball…
Balls and bins models are classical probabilistic models where balls are added to bins at random according to a certain rule. The balls and bins model with feedback is a non-linear generalisation of the P\'olya urn, where the probability of…