相关论文: The mixing time for simple exclusion
What is the time complexity of matrix multiplication of sparse integer matrices with $m_{in}$ nonzeros in the input and $m_{out}$ nonzeros in the output? This paper provides improved upper bounds for this question for almost any choice of…
The motivation of this work is to extend the techniques of higher order random walks on simplicial complexes to analyze mixing times of Markov chains for combinatorial problems. Our main result is a sharp upper bound on the second…
We prove moderate deviation principles for the tagged particle position and current in one-dimensional symmetric simple exclusion processes. There is at most one particle per site. A particle jumps to one of its two neighbors at rate $1/2$,…
We consider the zero-range process with arbitrary bounded monotone rates on the complete graph, in the regime where the number of sites diverges while the density of particles per site converges. We determine the asymptotics of the mixing…
In this paper, we present near-optimal space bounds for Lp-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector x \in R^n, a perfect Lp sampler outputs the i-th coordinate with…
Let $H\in C^1\cap W^{2,p}$ be an autonomous, non-constant Hamiltonian on a compact $2$-dimensional manifold, generating an incompressible velocity field $b=\nabla^\perp H$. We give sharp upper bounds on the enhanced dissipation rate of $b$…
Classically, the edit distance of two length-$n$ strings can be computed in $O(n^2)$ time, whereas an $O(n^{2-\epsilon})$-time procedure would falsify the Orthogonal Vectors Hypothesis. If the edit distance does not exceed $k$, the running…
We establish sharp lower bounds for the $2k$-th moment in the range $k \geq 1/2$ of the family of quadratic twists of modular $L$-functions at the central point.
We analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\sqrt{|G|\log |G| \log \log |G|})$ steps, not far…
Synchronizing clocks in a distributed system in which processes communicate through messages with uncertain delays is subject to inherent errors. Prior work has shown upper and lower bounds on the best synchronization achievable in a…
We compute the largest relaxation times for the totally asymmetric exclusion process (TASEP) with open boundary conditions with a DMRG method. This allows us to reach much larger system sizes than in previous numerical studies. We are then…
We study the asymptotic behavior for large $N$ of the disconnection time $T_N$ of a simple random walk on the discrete cylinder $(\mathbb{Z}/N\mathbb{Z})^d\times\mathbb{Z}$, when $d\ge2$. We explore its connection with the model of random…
We focus on one-sided, mixture-based stopping rules for the problem of sequential testing a simple null hypothesis against a composite alternative. For the latter, we consider two cases---either a discrete alternative or a continuous…
The longitudinal Seebeck coefficient of the charge-ordered layered crystals in a strong quantizing magnetic field normal to layers plane has been determined. The conditions whereby charge ordering parameter and chemical potential are…
Determining the mixing time of Kac's random walk on the sphere $\mathrm{S}^{n-1}$ is a long-standing open problem. We show that the total variation mixing time of Kac's walk on $\mathrm{S}^{n-1}$ is between $\frac{1}{2} \, n \log(n)$ and…
Motivated by kinetically constrained interacting particle systems (KCM), we consider a reversible coalescing and branching simple exclusion process on a general finite graph $G=(V,E)$ dual to the biased voter model on $G$. Our main goal are…
The one-dimensional totally asymmetric simple exclusion process (TASEP) with $N$ particles on a periodic lattice of $L$ sites is an interacting particle system with hopping rates breaking detailed balance. The total time-integrated current…
We study the mixing time of the Rook's Walk Markov chain on a $d$-dimensional chess board of side length $n\geq 3$, where a rook moves by first selecting an axis uniformly at random and then selecting a new position along that axis…
We study the $2k$-th moment of the family of twisted modular $L$-functions to a fixed prime power modulus at the central values. We establish sharp lower bounds for all real $k \geq 0$ and sharp upper bounds for $k$ in the range $0 \leq k…
This paper originally showed a lower bound on mixing time for a non-reversible Markov chain in terms of its largest non-trivial eigenvalue, and used this to re-derive some generalizations of results of Fan Chung. However, the paper has been…