Related papers: Minimax redundancy for Markov chains with large st…
In this paper, we study the large time behavior of solutions to the compressible magnetohydrodynamic equations in the $L^p$-type critical Besov spaces. Precisely, we show that if the initial data in the low frequencies additionally belong…
We derive new concentration bounds for time averages of measurement outcomes in quantum Markov processes. This generalizes well-known bounds for classical Markov chains which provide constraints on finite time fluctuations of time-additive…
We study finite-time spectral rigidity in reversible Markov chains via exact spectral relaxation dynamics. While the underlying identities follow classically from self-adjointness on $L^2(\pi)$, organizing the dynamics around the relaxation…
Let 0<\alpha<1/2. We show that the mixing time of a continuous-time reversible Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of stationary measure at least \alpha of the state space.…
We provide a general framework for computing upper bounds on mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary…
In this paper, the authors provide a weak decoding version of the traditional source coding theorem of Claude Shannon. The central bound that is obtained is \[ \chi>\log_{\epsilon}(2^{-n(H(X)+\epsilon)}) \] where \[…
The paper presents new asymptotic recurrent algorithms of phase space reduction for regularly and singularly perturbed semi-Markov processes. These algorithms give effective conditions of weak convergence for distributions and convergence…
Vacuum-energy calculations with ideal reflecting boundaries are plagued by boundary divergences, which presumably correspond to real (but finite) physical effects occurring near the boundary. Our working hypothesis is that the stress tensor…
We study the condensation phenomenon for the invariant measures of the mean-field model of reversible coagulation-fragmentation processes conditioned to a supercritical density of particles. It is shown that when the parameters of the…
We prove that the absolute spectral gap of any monotone Markov chain coincides with its optimal Ollivier-Ricci curvature, where the word `optimal' refers to the choice of the underlying metric. Moreover, we provide a new expression in terms…
It is now well known that the performance of a linear code $C$ under iterative decoding on a binary erasure channel (and other channels) is determined by the size of the smallest stopping set in the Tanner graph for $C$. Several recent…
Asymmetric Numeral Systems (ANS) is a class of entropy encoders that had an immense impact on the data compression, substituting arithmetic and Huffman coding. It was studied by different authors but the precise asymptotics of its…
Lossy data compression lies at the heart of modern communication and storage systems. Shannon's rate-distortion theory provides the fundamental limit on how much a source can be compressed at a given fidelity, but it assumes infinitely long…
In this paper, we present an efficiently encodable and decodable code construction that is capable of correction a burst of deletions of length at most $k$. The redundancy of this code is $\log n + k(k+1)/2\log \log n+c_k$ for some constant…
Shakhov model is a relaxation approximation of the Boltzmann equation proposed to overcome the deficiency of the original BGK model, namely, the incorrect production of the Prandtl number. In this paper, we address the existence and the…
Assume that one observes the $k$th, $2k$th$,\ldots,nk$th value of a Markov chain $X_{1,h},\ldots,X_{nk,h}$. That means we assume that a high frequency Markov chain runs in the background on a very fine time grid but that it is only observed…
A lossy source code $\mathcal{C}$ with rate $R$ for a discrete memoryless source $S$ is called subset-universal if for every $0<R'< R$, almost every subset of $2^{nR'}$ of its codewords achieves average distortion close to the source's…
In Monte-Carlo methods the Markov processes used to sample a given target distribution usually satisfy detailed balance, i.e. they are time-reversible. However, relatively recent results have demonstrated that appropriate reversible and…
For quantum phases of Hamiltonian ground states, the energy gap plays a central role in ensuring the stability of the phase as long as the gap remains finite. We propose Markov length, the length scale at which the quantum conditional…
We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for…