English
Related papers

Related papers: Erratum to: Model-checking continuous-time Markov …

200 papers

The book "Continuous-Time Markov Chains" by W. J. Anderson collects a large part of the development in the past thirty years. It is now a popular reference for the researchers on this subject or related fields. Unfortunately, due to a…

Probability · Mathematics 2015-01-22 Mu-Fa Chen

Errata for MNRAS 330, 821 (2002, astro-ph/0111084). A notation error in Eq. 7 and some typos in Table 3 corrected.

Astrophysics · Physics 2009-11-07 C. Lia , L. Portinari , G. Carraro

Theorem 2 of A. Kercheval, "Denjoy minimal sets are far from affine", Ergodic Theory and Dynamical Systems 22 (2002), 1803-1812 is corrected by adding a C^2 bound to the hypotheses.

Dynamical Systems · Mathematics 2010-04-09 Alec N. Kercheval

This paper provides a Central Limit Theorem (CLT) for a process $\{\theta_n, n\geq 0\}$ satisfying a stochastic approximation (SA) equation of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H(\theta_n,X_{n+1})$; a CLT for the associated…

Probability · Mathematics 2013-09-13 Gersende Fort

Lecture notes (in French) of a master 2 level course in applied mathematics. Contents: Part I. Markov chains on a countable space. 1. Examples 2. Summary of basic properties. 3. Spectral theory and speed of convergence. 4. Lyapunov…

History and Overview · Mathematics 2024-12-11 Nils Berglund

Inference-time methods that aggregate and prune multiple samples have emerged as a powerful paradigm for steering large language models, yet we lack any principled understanding of their accuracy-cost tradeoffs. In this paper, we introduce…

This is an erratum to the article: "Computation of maximal projection constants" (J. Funct. Anal., 277). The statement of Lemma 3.1(2) of that paper is incorrect. As a consequence of this the proof of Theorem 1.4 is incomplete. In this…

Functional Analysis · Mathematics 2024-06-27 Giuliano Basso

The basic question in perturbation analysis of Markov chains is: how do small changes in the transition kernels of Markov chains translate to chains in their stationary distributions? Many papers on the subject have shown, roughly, that the…

Probability · Mathematics 2025-08-13 Na Lin , Yuanyuan Liu , Aaron Smith

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic…

Logic in Computer Science · Computer Science 2007-05-23 Ruggero Lanotte , Daniele Beauquier

This note corrects conditions in Proposition 3.4 and Theorem 5.2(ii) and comments on imprecisions in Propositions 4.2 and 4.4 in Fissler and Ziegel (2016).

Statistics Theory · Mathematics 2021-02-01 Tobias Fissler , Johanna F. Ziegel

We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…

Logic in Computer Science · Computer Science 2016-06-29 R van der Meyden , M K Patra

A simple linear algebraic explanation of the algorithm in "A Spectral Algorithm for Learning Hidden Markov Models" (COLT 2009). Most of the content is in Figure 2; the text just makes everything precise in four nearly-trivial claims.

Methodology · Statistics 2012-04-12 Matthew James Johnson

Parametric Markov chains occur quite naturally in various applications: they can be used for a conservative analysis of probabilistic systems (no matter how the parameter is chosen, the system works to specification); they can be used to…

Logic in Computer Science · Computer Science 2018-11-05 Paul Gainer , Ernst Moritz Hahn , Sven Schewe

A sequence-to-sequence learning with neural networks has empirically proven to be an effective framework for Chinese Spelling Correction (CSC), which takes a sentence with some spelling errors as input and outputs the corrected one.…

Computation and Language · Computer Science 2021-06-02 Chong Li , Cenyuan Zhang , Xiaoqing Zheng , Xuanjing Huang

We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…

Logic in Computer Science · Computer Science 2015-11-11 Ron van der Meyden , Manas K. Patra

This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986)…

Probability · Mathematics 2016-02-17 Jeffrey J. Hunter

This short note reviews the basic theory for quantifying both the asymptotic and preasymptotic convergence of Markov chain Monte Carlo estimators.

Probability · Mathematics 2021-10-15 Michael Betancourt

Minimum-weight perfect matching (MWPM) has been been the primary classical algorithm for error correction in the surface code, since it is of low runtime complexity and achieves relatively low logical error rates [Phys. Rev. Lett. 108,…

Quantum Physics · Physics 2014-02-20 Adrian Hutter , James R. Wootton , Daniel Loss

A few typos in Mamajek, Meyer, & Liebert (2002, AJ, 124, 1670) have been corrected in this erratum (including two stellar misidentifications and an incorrect power in the units of a slope). The most significant is the correction of a sign…

Astrophysics · Physics 2008-11-26 E. E. Mamajek , M. R. Meyer , J. Liebert

In this article, we give a counter-example to Lemma 12 of the article "On Operations and Linear Extensions of Well Partially Ordered Sets" by Maciej Malicki and Aleksander Rutkowski.

Combinatorics · Mathematics 2019-04-30 Laurent Lyaudet