相关论文: The mixing time for simple exclusion

Let W be the number of points in (0,t] of a stationary finite-state Markov renewal point process. We derive a bound for the total variation distance between the distribution of W and a compound Poisson distribution. For any nonnegative…

We consider the asymmetric simple exclusion process confined to the nonnegative integers with an open boundary at 0. The point 0 is connected to a reservoir where particles are injected and ejected at prescribed rates subject to the…

We show that for the mean zero simple exclusion process in $\mathbb {Z}^d$ and for the asymmetric simple exclusion process in $\mathbb{Z}^d$ for $d\geq3$, the self-diffusion coefficient of a tagged particle is stable when approximated by…

We prove an O(log n) bound for the expected value of the logarithm of the componentwise (and, a fortiori, the mixed) condition number of a random sparse n x n matrix. As a consequence, small bounds on the average loss of accuracy for…

Like other critical phenomena, the jamming transition accompanies the divergence of the relaxation time $\tau$. A recent numerical study of frictionless spherical particles proves that $\tau$ is inversely proportional to the lowest non-zero…

For any stationary $\mZ^d$-Gibbs measure that satisfies strong spatial mixing, we obtain sequences of upper and lower approximations that converge to its entropy. In the case, $d=2$, these approximations are efficient in the sense that the…

Viewing a two time scale stochastic approximation scheme as a noisy discretization of a singularly perturbed differential equation, we obtain a concentration bound for its iterates that captures its behavior with quantifiable high…

Estimating the second frequency moment $F_2$ of a data stream up to a $(1 \pm \varepsilon)$ factor is a central problem in the streaming literature. For errors $\varepsilon > \Omega(1/\sqrt{n})$, the tight bound…

We investigate a novel variant of the exclusion process in which particles perform asymmetric nearest-neighbor jumps across a bond \((k, k+1)\) only if the preceding site \((k-1)\) is unoccupied. This next-nearest-neighbor constraint…

We discuss a restriction on relaxation times derived from the Lindblad-type master equations for 2-level systems and show that none of the inverse relaxation times can be greater than the sum of the others. The relation is experimentally…

We study the rate of convergence to equilibrium of the self-repellent random walk and its local time process on the discrete circle $\mathbb{Z}_n$. While the self-repellent random walk alone is non-Markovian since the jump rates depend on…

We prove that the equilibrium fluctuations of the symmetric simple exclusion process in contact with slow boundaries is given by an Ornstein-Uhlenbeck process with Dirichlet, Robin or Neumann boundary conditions depending on the range of…

We compute the mixing time of the Facilitated Exclusion Process (FEP) and obtain cutoff and pre-cutoff in different regimes. The main tool to obtain this result is a new bijective, deterministic mapping between the joint law of an ergodic…

We show that the classical Pollard rho algorithm for discrete logarithms produces a collision in expected time O(sqrt(n)(log n)^3). This is the first nontrivial rigorous estimate for the collision probability for the unaltered Pollard rho…

We study the robustness under perturbations of mixing times, by studying mixing times of random walks in percolation clusters inside boxes in $\Z^d$. We show that for $d \geq 2$ and $p > p_c(\Z^d)$, the mixing time of simple random walk on…

We estimate the mixing time of the a nonreversible finite Markov chain called Repeated Balls-into-Bins (RBB) process. This process is a discrete time conservative interacting particle system with parallel updates. Place initially in $L$…

We give simplify the proofs of the 2 results in Marius Zimand's paper "Kolmogorov complexity version of Slepian-Wolf coding, proceedings of STOC 2017, p22--32". The first is a universal polynomial time compression algorithm: on input…

Recent advances have significantly improved our understanding of the sample complexity of learning in average-reward Markov decision processes (AMDPs) under the generative model. However, much less is known about the constrained…

This work considers the sample complexity of obtaining an $\varepsilon$-optimal policy in an average reward Markov Decision Process (AMDP), given access to a generative model (simulator). When the ground-truth MDP is weakly communicating,…

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…