Related papers: On spectral gap decomposition for Markov chains
Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding and cryptography. In this paper, lattice reduction technique is adopted to Gibbs sampler for lattice Gaussian sampling. Firstly, with…
Understanding the impact of spectral coverage on parameter recovery is critical for accurate interpretation of blazar spectra. In this study, we examine how the data coverage influences the reliability of parameter estimation within the…
This paper studies a finite reversible lumpable Markov chain for which relaxed spectral compression yields a larger determinant than partition-constrained compression. For a symmetric six-state lumpable chain and the positive operator…
This thesis introduces a way to build Markov chains out of Hopf algebras. The transition matrix of a "Hopf-power Markov chain" is (the transpose of) the matrix of the coproduct-then-product operator on a combinatorial Hopf algebra with…
The aim of this note is to present an elementary proof of a variation of Harris' ergodic theorem of Markov chains. This theorem, dating back to the fifties essentially states that a Markov chain is uniquely ergodic if it admits a ``small''…
Let $\Gamma < G := \operatorname{SO}(d+1, 1)$ for $d \geq 1$ be a Zariski dense, geometrically finite, discrete subgroup with critical exponent strictly greater than $d/2$. We show that $L^2(\Gamma\backslash G)$ admits a strong spectral…
We address the problem of estimating the mixing time $t_{\mathsf{mix}}$ of an arbitrary ergodic finite-state Markov chain from a single trajectory of length $m$. The reversible case was addressed by Hsu et al. [2019], who left the general…
We develop a general technique, based on a Bochner-type identity, to estimate spectral gaps of a class of Markov operator. We apply this technique to various interacting particle systems. In particular, we give a simple and short proof of…
We consider a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure. A sufficient condition for defining a CTMC over the aggregates is presented as a…
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of…
This paper studies the subgeometric convergence of the stationary distribution in taking the infinite-level limit of a finite-level M/G/1-type Markov chain, that is, in letting the upper boundary level go to infinity. This study is…
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of…
In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The…
Predicting electronic band structures from crystal structures is crucial for understanding structure-property correlations in materials science. First-principles approaches are accurate but computationally intensive. Recent years, machine…
Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…
Stable commutator length scl_G(g) of an element g in a group G is an invariant for group elements sensitive to the geometry and dynamics of G. For any group G acting on a tree, we prove a sharp bound scl_G(g)>=1/2 for any g acting without…
The existence of a strong spectral gap for quotients $\Gamma\bs G$ of noncompact connected semisimple Lie groups is crucial in many applications. For congruence lattices there are uniform and very good bounds for the spectral gap coming…
Given an arbitrary graph $E$ we investigate the relationship between $E$ and the groupoid $G_E$. We show that there is a lattice isomorphism between the lattice of pairs $(H, S)$, where $H$ is a hereditary and saturated set of vertices and…
Matrix models for the deconfining phase transition in $SU(N)$ gauge theories have been developed in recent years. With a few parameters, these models are able to reproduce the lattice results of the thermodynamic quantities in the…
Dissipative phase transitions in quantum systems have been largely studied under the so-called Markovian approximation, where the environments to which the systems are coupled are memoryless. Here, we present a generalization of the…