Results 61 to 70 of about 102,876 (329)
Effective Berry–Esseen and concentration bounds for Markov chains with a spectral gap
The Annals of Applied Probability, 2019 Applying quantitative perturbation theory for linear operators, we prove nonasymptotic bounds for Markov chains whose transition kernel has a spectral gap in an arbitrary Banach algebra of functions X . The main results are concentration inequalities and
Benoît R. Kloeckner
semanticscholar +1 more source
Perturbation Bounds for the Stationary Distributions of Markov Chains [PDF]
SIAM Journal on Matrix Analysis and Applications, 2012 In this paper, we are interested in investigating the perturbation bounds for the stationary distributions for discrete-time or continuous-time Markov chains on a countable state space.
Yuanyuan Liu
semanticscholar +1 more source
Two Novel S‐methyltransferases Confer Dimethylsulfide Production in Actinomycetota
Advanced Science, EarlyView.This study identifies two novel S‐adenosine‐methionine‐dependent methyltransferases, MddM1 and MddM2, in actinomycetes from the Mariana Trench. These enzymes can convert toxic hydrogen sulfide (H2S) and methanethiol (MeSH) into dimethylsulfide (DMS), serving as a cellular detoxification and oxidative stress response.
Ruihong Guo +11 more
wiley +1 more source
Analyticity of Entropy Rate of Hidden Markov Chains [PDF]
, 2005 We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine the domain of analyticity is stated.
Han, Guangyue, Marcus, Brian
core +4 more sources
Temporal Transcriptional Regulation of Human Neuronal Differentiation via Forward Programming
Advanced Science, EarlyView.Single‐cell profiling of TF‐induced forward programming versus stepwise dual‐SMAD differentiation reveals that divergent trajectories set the pace of neurogenesis. OLIG TFs advance cell‐cycle exit via NOTCH modulation, while NEUROD2 later accelerates maturation. The study elucidates transcriptional mechanisms governing differentiation timing, providing
Lingling Zhu +13 more
wiley +1 more source
Entropy, 2017 We explored the dynamics of two interacting information systems. We show that for the Markovian marginal systems, the driving force for information dynamics is determined by both the information landscape and information flux.
Qian Zeng, Jin Wang
doaj +1 more source
IEEE Access, 2021 This paper investigates the problem of state feedback controller design for discrete-time Markovian jump systems (MJSs) with time delay and two Markov chains under partly known transition probabilities. First, by constructing improved Lyapunov-Krasovskii
Yuan Li +3 more
doaj +1 more source
Local stationarity and time-inhomogeneous Markov chains [PDF]
Annals of Statistics, 2016 In this paper, we study a notion of local stationarity for discrete time Markov chains which is useful for applications in statistics. In the spirit of some locally stationary processes introduced in the literature, we consider triangular arrays of time ...
L. Truquet
semanticscholar +1 more source
Advanced Science, EarlyView.This study proposes a degradation estimation technique to explicitly describe compressive sampling for low‐sampling Hadamard single‐pixel imaging. Blur kernels in explicit degradation models are estimated by the self‐supervised learning method without labeled data and implicit priors.
Haoyu Zhang +4 more
wiley +1 more source
On the connections between PCTL and Dynamic Programming
, 2009 Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking.
Chatterjee, Debasish +3 more
core +1 more source