Concentration inequalities for Markov chains by Marton couplings and spectral methods
From MaRDI portal
Publication:2515947
DOI10.1214/EJP.v20-4039zbMath1342.60121arXiv1212.2015MaRDI QIDQ2515947
Publication date: 7 August 2015
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.2015
Inequalities; stochastic orderings (60E15) Discrete-time Markov processes on general state spaces (60J05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
Rapid mixing of geodesic walks on manifolds with positive curvature, Concentration inequalities for non-causal random fields, A Hoeffding inequality for Markov chains, A note on transportation cost inequalities for diffusions with reflections, Adaptive Huber regression on Markov-dependent data, Hypothesis testing for Markov chain Monte Carlo, Transport-information inequalities for Markov chains, Elementary bounds on mixing times for decomposable Markov chains, Normal Approximation for Functions of Hidden Markov Models, Exponential inequalities for nonstationary Markov chains, A quantitative McDiarmid's inequality for geometrically ergodic Markov chains, Hold-out estimates of prediction models for Markov processes, A concentration bound for \(\operatorname{LSPE}( \lambda )\), Learning Markov Models Via Low-Rank Optimization, Complexity results for MCMC derived from quantitative bounds, Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings, Improved estimation of relaxation time in nonreversible Markov chains, On the occupancy problem for a regime-switching model, Dimension‐independent Markov chain Monte Carlo on the sphere, On the \(\alpha\)-lazy version of Markov chains in estimation and testing problems, Community structure recovery and interaction probability estimation for gossip opinion dynamics, Improving Hoeffding's inequality using higher moments information, Gaussian concentration bounds for stochastic chains of unbounded memory, Spectral norm bounds for block Markov chain random matrices, Singular value distribution of dense random matrices with block Markovian dependence, Mixing and concentration by Ricci curvature, Concentration inequality for U-statistics of order two for uniformly ergodic Markov chains, Statistical estimation of ergodic Markov chain kernel over discrete state space, Function-specific mixing times and concentration away from equilibrium, Concentration of Markov chains with bounded moments, A concentration bound for contractive stochastic approximation, Local M-estimation with discontinuous criterion for dependent and limited observations, Lower bounds for moments of global scores of pairwise Markov chains, Respondent-driven sampling and sparse graph convergence, On concentration inequalities for vector-valued Lipschitz functions, Adaptive invariant density estimation for ergodic diffusions over anisotropic classes, Clustering in block Markov chains, An online algorithm for the risk-aware restless bandit, Metropolis-Hastings reversiblizations of non-reversible Markov chains, General Bernstein-like inequality for additive functionals of Markov chains, On limit theorems for persistent Betti numbers from dependent data, Talagrand concentration inequalities for stochastic partial differential equations, On the rate of convergence for the length of the longest common subsequences in hidden Markov models, On the Cover Time of Dense Graphs, When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence, Generalized high-dimensional trace regression via nuclear norm regularization, Analysis of non-reversible Markov chains via similarity orbits, Nonparametric Bayesian posterior contraction rates for scalar diffusions with high-frequency data, Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings, MCMC for Imbalanced Categorical Data, The Convex Mixture Distribution: Granger Causality for Categorical Time Series, Adaptive invariant density estimation for continuous-time mixing Markov processes under sup-norm risk, Unnamed Item, Mixing time estimation in reversible Markov chains from a single sample path, Fundamental design principles for reinforcement learning algorithms, Unnamed Item, Generalized Markov chain tree theorem and Kemeny's constant for a class of non-Markovian matrices
