相关论文: The mixing time for simple exclusion

We establish optimal error bounds on time-splitting methods for the nonlinear Schr\"odinger equation with low regularity potential and typical power-type nonlinearity $ f(\rho) = \rho^\sigma $, where $ \rho:=|\psi|^2 $ is the density with $…

We prove that the continuous-time, single-flip Glauber dynamics for lozenge tilings of the size-$N$ hexagon mix in time $N^{2+o(1)}$. This was predicted to hold on fairly general domains of diameter $N$ (on the basis of the ``Lifshitz law''…

Let $\Lambda$ be a connected closed region with smooth boundary contained in the $d$-dimensional continuous torus $\bb T^d$. In the discrete torus $N^{-1} \bb T^d_N$, we consider a nearest neighbor symmetric exclusion process where…

Based on an optimal rate wavelet series representation, we derive a local modulus of continuity result with a refined almost sure upper bound for fractional Brownian motion. \sloppy The obtained upper bound of the small fractional Brownian…

Usually, the relaxation times of a gas are estimated in the frame of the Boltzmann equation. In this paper, instead, we deal with the relaxation problem in the frame of the dynamical theory of Hamiltonian systems, in which the definition…

We show that the order of the $L_{\infty}$-mixing time of simple random walks on a sequence of uniformly bounded degree graphs of size $n$ may increase by an optimal factor of $\Theta( \log \log n)$ as a result of a bounded perturbation of…

In this thesis we study properties of open quantum dissipative evolutions of spin systems on lattices described by Lindblad generators, in a particular regime that we denote rapid mixing. We consider dissipative evolutions with a unique…

In [Combinatorics, Probability and Computing 16 (2007), 557 - 593, Theorem 1] we proved a polynomial-time bound on the mixing rate of the switch chain for sampling d-regular graphs. This corrigendum corrects a technical error in the proof.…

We study the non-equilibrium dynamics of a one-dimensional interacting particle system that is a mixture of the voter model and the exclusion process. With the process started from a finite perturbation of the ground state Heaviside…

We analyze the general biased adjacent transposition shuffle process, which is a well-studied Markov chain on the symmetric group $S_n$. In each step, an adjacent pair of elements $i$ and $j$ are chosen, and then $i$ is placed ahead of $j$…

We show bounds on total variation and $L^{\infty}$ mixing times, spectral gap and magnitudes of the complex valued eigenvalues of a general (non-reversible non-lazy) Markov chain with a minor expansion property. This leads to the first…

A simple way to sample a uniform triangulation of the sphere with a fixed number $n$ of vertices is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound in…

We study mixing times of the one-sided $k$-transposition shuffle. We prove that this shuffle mixes relatively slowly, even for $k$ big. Using the recent "lifting eigenvectors" technique of Dieker and Saliola and applying the $\ell^2$ bound,…

Let $x_1,\dots,x_{n}$ be a fixed sequence of real numbers. At each stage, pick $k$ integers $\{I_{i}\}_{1\leq i \leq k}$ uniformly at random without replacement and then for each $i \in \{1,2,\dots,k\}$ replace $x_{I_i}$ by…

Michel proved that for a one-parameter family of elliptic curves over Q(T) with non-constant j(T) that the second moment of the number of solutions modulo p is p^2 + O(p^{3/2}). We show this bound is sharp by studying y^2 = x^3 + Tx^2 + 1.…

We derive upper and lower bounds on the overall compression ratio of the 1978 Lempel-Ziv (LZ78) algorithm, applied independently to $k$-blocks of a finite individual sequence. Both bounds are given in terms of normalized empirical entropies…

Markov chain methods are remarkably successful in computational physics, machine learning, and combinatorial optimization. The cost of such methods often reduces to the mixing time, i.e., the time required to reach the steady state of the…

We study the problem of explainable clustering in the setting first formalized by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). A $k$-clustering is said to be explainable if it is given by a decision tree where each internal node…

The spectral gap of a Markov chain can be bounded by the spectral gaps of constituent "restriction" chains and a "projection" chain, and the strength of such a bound is the content of various decomposition theorems. In this paper, we…

We study the maximum likelihood estimator of density of $n$ independent observations, under the assumption that it is well approximated by a mixture with a large number of components. The main focus is on statistical properties with respect…