Related papers: Spectral gap for the interchange process in a box
We calculate the spectral gap of the Markov matrix of the totally asymmetric simple exclusion process (TASEP) on a ring of L sites with N particles. Our derivation is simple and self-contained and extends a previous calculation that was…
The spectral gap for Laplace operators on metric graphs is investigated in relation to graph's connectivity, in particular what happens if an edge is added to (or deleted from) a graph. It is shown that in contrast to discrete graphs…
Let $V=\mathbb R^d$ be the Euclidean $d$-dimensional space, $\mu$ (resp $\lambda$) a probability measure on the linear (resp affine) group $G=G L (V)$ (resp $H= \Aff (V))$ and assume that $\mu$ is the projection of $\lambda$ on $G$. We…
The spectral gap is estimated for measure-valued diffusion processes induced by the intrinsic/extrinsic derivatives on the space of finite measures over a Riemannian manifold. This provides explicit exponential convergence rate for these…
Let $L$ be the Hill operator or the one dimensional Dirac operator on the interval $[0,\pi].$ If $L$ is considered with Dirichlet, periodic or antiperiodic boundary conditions, then the corresponding spectra are discrete and for large…
There are many Markov chains on infinite dimensional spaces whose one-step transition kernels are mutually singular when starting from different initial conditions. We give results which prove unique ergodicity under minimal assumptions on…
Let $M$ be a connected, noncompact, complete Riemannian manifold, consider the operator $L=\DD +\nn V$ for some $V\in C^2(M)$ with $\exp[V]$ integrable w.r.t. the Riemannian volume element. This paper studies the existence of the spectral…
We prove a general theorem on cutoffs for symmetric simple exclusion processes on graphs with open boundaries, under the natural assumption that the graphs converge geometrically and spectrally to a compact metric measure space with…
We show that there is a natural restriction on the smoothness of spaces where the transfer operator for a continuous dynamical system has a spectral gap. Such a space cannot be embedded in a H\"older space with H\"older exponent greater…
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in $\Z^d$. We focus on the cases when an edge between $x$ and $y$ is added with probability decaying with the Euclidean…
Oliveira conjectured that the order of the mixing time of the exclusion process with $k$-particles on an arbitrary $n$-vertex graph is at most that of the mixing-time of $k$ independent particles. We verify this up to a constant factor for…
Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…
We prove that a measure on $[-d, d]$ is the spectral measure of a factor of i.i.d. process on a vertex-transitive infinite graph if and only if it is absolutely continuous with respect to the spectral measure of the graph. Moreover, we show…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
We show that in any graph, the average length of a flow path in an electrical flow between the endpoints of a random edge is $O(\log^2 n)$. This is a consequence of a more general result which shows that the spectral norm of the entrywise…
In this note we elaborate on the asymptotic behavior of the spectral gap of a class of discrete Schr\"odinger operators defined on a path graph in the limit of infinite volume. We confirm recent results and generalize them to a larger class…
The abelian sandpile model defines a Markov chain whose states are integer-valued functions on the vertices of a simple connected graph $G$. By viewing this chain as a (nonreversible) random walk on an abelian group, we give a formula for…
We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…
In this paper, we study the spectra of regular hypergraphs following the definitions from Feng and Li (1996). Our main result is an analog of Alon's conjecture for the spectral gap of the random regular hypergraphs. We then relate the…