Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[KSIĄŻKA][B] Markov chains: Basic definitions
R Douc, E Moulines, P Priouret, P Soulier, R Douc… - 2018 - Springer
Heuristically, a discrete-time stochastic process has the Markov property if the past and
future are independent given the present. In this introductory chapter, we give the formal …
future are independent given the present. In this introductory chapter, we give the formal …
Overcoming the timescale barrier in molecular dynamics: Transfer operators, variational principles and machine learning
One of the main challenges in molecular dynamics is overcoming the 'timescale barrier': in
many realistic molecular systems, biologically important rare transitions occur on timescales …
many realistic molecular systems, biologically important rare transitions occur on timescales …
A non‐conservative Harris ergodic theorem
We consider non‐conservative positive semigroups and obtain necessary and sufficient
conditions for uniform exponential contraction in weighted total variation norm. This ensures …
conditions for uniform exponential contraction in weighted total variation norm. This ensures …
Hoeffding's inequality for general Markov chains and its applications to statistical learning
This paper establishes Hoeffding's lemma and inequality for bounded functions of general-
state-space and not necessarily reversible Markov chains. The sharpness of these results is …
state-space and not necessarily reversible Markov chains. The sharpness of these results is …
Uniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs samplers
Uniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs
samplers Page 1 Bernoulli 24(2), 2018, 842–872 DOI: 10.3150/15-BEJ785 Uniform ergodicity of …
samplers Page 1 Bernoulli 24(2), 2018, 842–872 DOI: 10.3150/15-BEJ785 Uniform ergodicity of …
Convergence rates of Metropolis–Hastings algorithms
Given a target probability density known up to a normalizing constant, the Metropolis–
Hastings algorithm simulates realizations from a Markov chain which are eventual …
Hastings algorithm simulates realizations from a Markov chain which are eventual …
Randomized Hamiltonian Monte Carlo as scaling limit of the bouncy particle sampler and dimension-free convergence rates
The bouncy particle sampler is a Markov chain Monte Carlo method based on a
nonreversible piecewise deterministic Markov process. In this scheme, a particle explores …
nonreversible piecewise deterministic Markov process. In this scheme, a particle explores …
Convergence Bounds for Monte Carlo Markov Chains
Q Qin - arxiv preprint arxiv:2409.14656, 2024 - arxiv.org
This review paper, written for the second edition of the Handbook of Markov Chain Monte
Carlo, provides an introduction to the study of convergence analysis for Markov chain Monte …
Carlo, provides an introduction to the study of convergence analysis for Markov chain Monte …
Spectral gap of nonreversible Markov chains
S Chatterjee - arxiv preprint arxiv:2310.10876, 2023 - arxiv.org
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 …
singular value of the generator of the chain, generalizing the usual definition of spectral gap …
Reality only happens once: Single-path generalization bounds for transformers
One of the inherent challenges in deploying transformers on time series is that\emph {reality
only happens once}; namely, one typically only has access to a single trajectory of the data …
only happens once}; namely, one typically only has access to a single trajectory of the data …