arXiv subjects
Publications and source records attributed to Dominik Schmid.
We study the speed of convergence to equilibrium for the asymmetric simple exclusion process (ASEP) on a finite interval with one open boundary. We provide sharp estimates on the total-variation distance from equilibrium and verify that the limit profile undergoes a phase transition from a Gaussian to a KPZ profile.
We introduce and analyze the $S_k$ shuffle on $N$ cards, a natural generalization of the celebrated random adjacent transposition shuffle. In the $S_k$ shuffle, we choose uniformly at random a block of $k$ consecutive cards, and shuffle these cards according to a permutation chosen uniformly at random from the symmetric group on $k$ elements. We study the total-variation mixing time of the $S_k$ shuffle when the number of cards $N$ goes to infinity, allowing also $k=k(N)$ to grow with $N$. In particular, we show that the cutoff phenomenon occurs when $k=o(N^{\frac{1}{6}})$.
We study mixing times for the totally asymmetric simple exclusion process (TASEP) on a segment of size $N$ with open boundaries. We focus on the maximal current phase, and prove that the mixing time is of order $N^{3/2}$, up to logarithmic corrections. In the triple point, where the TASEP with open boundaries approaches the Uniform distribution on the state space, we show that the mixing time is precisely of order $N^{3/2}$. This is conjectured to be the correct order of the mixing time for a wide range of particle systems with maximal current. Our arguments rely on a connection to last-passage percolation, and recent results on moderate deviations of last-passage times.
We study mixing times of the symmetric and asymmetric simple exclusion process on the segment where particles are allowed to enter and exit at the endpoints. We consider different regimes depending on the entering and exiting rates as well as on the rates in the bulk, and show that the process exhibits pre-cutoff and in some cases cutoff. Our main contribution is to study mixing times for the asymmetric simple exclusion process with open boundaries. We show that the order of the mixing time can be linear or exponential in the size of the segment depending on the choice of the boundary parameters, proving a strikingly different (and richer) behavior for the simple exclusion process with open boundaries than for the process on the closed segment. Our arguments combine coupling, second class particle and censoring techniques with current estimates. A novel idea is the use of multi-species particle arguments, where the particles only obey a partial ordering.
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine whether the cutoff phenomenon occurs. We thoroughly discuss families of trees with cutoff, and show how our criteria can be used to prove the absence of cutoff for several classes of trees, including spherically symmetric trees, Galton-Watson trees of a fixed height, and sequences of random trees converging to the Brownian CRT.
We study the asymptotics of the $k$-regular self-similar fragmentation process. For $α> 0$ and an integer $k \geq 2$, this is the Markov process $(I_t)_{t \geq 0}$ in which each $I_t$ is a union of open subsets of $[0,1)$, and independently each subinterval of $I_t$ of size $u$ breaks into $k$ equally sized pieces at rate $u^α$. Let $k^{ - m_t}$ and $k^{ - M_t}$ be the respective sizes of the largest and smallest fragments in $I_t$. By relating $(I_t)_{t \geq 0}$ to a branching random walk, we find that there exist explicit deterministic functions $g(t)$ and $h(t)$ such that $|m_t - g(t)| \leq 1$ and $|M_t - h(t)| \leq 1$ for all sufficiently large $t$. Furthermore, for each $n$, we study the final time at which fragments of size $k^{-n}$ exist. In particular, by relating our branching random walk to a certain point process, we show that, after suitable rescaling, the laws of these times converge to a Gumbel distribution as $n \to \infty$.
We study two different versions of the simple exclusion process on augmented Galton-Watson trees, the constant speed model and the varying speed model. In both cases, the simple exclusion process starts from an equilibrium distribution with non-vanishing particle density. Moreover, we assume to have initially a particle in the root, the tagged particle. We show for both models that the tagged particle has a positive linear speed and we give explicit formulas for the speeds.
We consider the exclusion process on segments of the integers in a site-dependent random environment. We assume to be in the ballistic regime in which a single particle has positive linear speed. Our goal is to study the mixing time of the exclusion process when the number of particles is linear in the size of the segment. We investigate the order of the mixing time depending on the support of the environment distribution. In particular, we prove for nestling environments that the order of the mixing time is different than in the case of a single particle.
We consider exclusion processes on a rooted $d$-regular tree. We start from a Bernoulli product measure conditioned on having a particle at the root, which we call the tagged particle. For $d\geq 3$, we show that the tagged particle has positive linear speed and satisfies a central limit theorem. We give an explicit formula for the speed. As a key step in the proof, we first show that the exclusion process "seen from the tagged particle" has an ergodic invariant measure.
The purpose of this article is to introduce a new class of kernels on SO(3) for approximation and interpolation, and to estimate the approximation power of the associated spaces. The kernels we consider arise as linear combinations of Green's functions of certain differential operators on the rotation group. They are conditionally positive definite and have a simple closed-form expression, lending themselves to direct implementation via, e.g., interpolation, or least-squares approximation. To gauge the approximation power of the underlying spaces, we introduce an approximation scheme providing precise L_p error estimates for linear schemes, namely with L_p approximation order conforming to the L_p smoothness of the target function.