English
Related papers

Related papers: Quantitative Spectral Rigidity and Finite-Time Spe…

200 papers

We obtain universal estimates on the convergence to equilibrium and the times of coupling for continuous time irreducible reversible finite-state Markov chains, both in the total variation and in the L^2 norms. The estimates in total…

Probability · Mathematics 2012-01-24 Mykhaylo Shkolnikov

We argue that the spectral theory of non-reversible Markov chains may often be more effectively cast within the framework of the naturally associated weighted-$L_\infty$ space $L_\infty^V$, instead of the usual Hilbert space $L_2=L_2(\pi)$,…

Probability · Mathematics 2009-06-30 Ioannis Kontoyiannis , Sean P. Meyn

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

Data Structures and Algorithms · Computer Science 2021-11-08 Nima Anari , Vishesh Jain , Frederic Koehler , Huy Tuan Pham , Thuy-Duong Vuong

For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…

We develop a framework for the compression of reversible Markov chains with rigorous error control. Given a subset of selected states, we construct reduced dynamics that can be lifted to an approximation of the full dynamics, and we prove…

Numerical Analysis · Mathematics 2025-09-03 Mark Fornace , Michael Lindsey

It is known that state-dependent, multi-step Lyapunov bounds lead to greatly simplified verification theorems for stability for large classes of Markov chain models. This is one component of the "fluid model" approach to stability of…

Optimization and Control · Mathematics 2012-05-18 Serdar Yüksel , Sean P. Meyn

We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights to the edges of the complete graph over n vertices and normalizing by the corresponding row sum. The weights are assumed to be in the domain…

Probability · Mathematics 2012-11-19 Charles Bordenave , Pietro Caputo , Djalil Chafaï

We prove an upper bound on the total variation mixing time of a finite Markov chain in terms of the absolute spectral gap and the number of elements in the state space. Unlike results requiring reversibility or irreducibility, this bound is…

Probability · Mathematics 2013-10-31 Daniel Jerison

We propose an exact technique to calculate lower bounds of spectral gaps of discrete time reversible Markov chains on finite state sets. Spectral gaps are a common tool for evaluating convergence rates of Markov chains. As an illustration,…

Statistical Mechanics · Physics 2016-08-31 N. Destainville

We define the spectral gap of a Markov chain on a finite state space as the second-smallest singular value of the generator of the chain, generalizing the usual definition of spectral gap for reversible chains. We then define the relaxation…

Probability · Mathematics 2025-01-07 Sourav Chatterjee

We analyse the $\ell^2(\pi)$-convergence rate of irreducible and aperiodic Markov chains with $N$-band transition probability matrix $P$ and with invariant distribution $\pi$. This analysis is heavily based on: first the study of the…

Probability · Mathematics 2015-11-06 Loïc Hervé , James Ledoux

This work is devoted to the almost sure stabilization of adaptive control systems that involve an unknown Markov chain. The control system displays continuous dynamics represented by differential equations and discrete events given by a…

Probability · Mathematics 2008-07-10 Bernard Bercu , Francois Dufour , G. George Yin

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…

Probability · Mathematics 2026-04-14 Oleg Kiriukhin

This paper considers the speed of convergence (mixing) of a finite Markov kernel $P$ with respect to the Kullback-Leibler divergence (entropy). Given a Markov kernel one defines either a discrete-time Markov chain (with the $n$-step…

Probability · Mathematics 2024-09-13 Pietro Caputo , Zongchen Chen , Yuzhou Gu , Yury Polyanskiy

Estimating the entropy based on data is one of the prototypical problems in distribution property testing and estimation. For estimating the Shannon entropy of a distribution on $S$ elements with independent samples, [Paninski2004] showed…

Machine Learning · Computer Science 2018-09-25 Yanjun Han , Jiantao Jiao , Chuan-Zheng Lee , Tsachy Weissman , Yihong Wu , Tiancheng Yu

We propose a new approach to the spectral theory of perturbed linear operators , in the case of a simple isolated eigenvalue. We obtain two kind of results: ''radius bounds'' which ensure perturbation theory applies for perturbations up to…

Spectral Theory · Mathematics 2025-04-08 Benoît Kloeckner

This paper develops a closed-form spectral decomposition framework for the Gramian matrices of discrete-time linear dynamical systems. The main results provide explicit decompositions of the discrete-time controllability Gramian and its…

Optimization and Control · Mathematics 2026-04-02 Alexey Iskakov

We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum…

Quantum Physics · Physics 2022-06-01 Li Gao , Cambyse Rouzé

We introduce a unified operator-theoretic framework for analyzing mixing times of finite-state ergodic Markov chains that applies to both reversible and non-reversible dynamics. The central object in our analysis is the projected transition…

Probability · Mathematics 2025-11-05 Muhammad Abdullah Naeem

The spectral gap $\gamma$ of a finite, ergodic, and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to…

Statistics Theory · Mathematics 2017-08-25 Daniel Hsu , Aryeh Kontorovich , David A. Levin , Yuval Peres , Csaba Szepesvári
‹ Prev 1 2 3 10 Next ›