English
Related papers

Related papers: On estimating the memory for finitarily Markovian …

200 papers

We give a systematic expansion of the crypticity--a recently introduced measure of the inaccessibility of a stationary process's internal state information. This leads to a hierarchy of k-cryptic processes and allows us to identify…

Statistical Mechanics · Physics 2009-06-01 John R. Mahoney , Christopher J. Ellison , James P. Crutchfield

The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…

Probability · Mathematics 2018-04-30 Shohei Hidaka

For every $n\in\N$, let $X_{1n},..., X_{nn}$ be independent copies of a zero-mean Gaussian process $X_n=\{X_n(t), t\in T\}$. We describe all processes which can be obtained as limits, as $n\to\infty$, of the process $a_n(M_n-b_n)$, where…

Probability · Mathematics 2009-09-03 Zakhar Kabluchko

We consider fragmentation processes with values in the space of marked partitions of $\mathbb{N}$, i.e. partitions where each block is decorated with a nonnegative real number. Assuming that the marks on distinct blocks evolve as…

Probability · Mathematics 2020-10-26 Jean-Jil Duchamps

Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the…

Computer Science and Game Theory · Computer Science 2022-09-29 Krishnendu Chatterjee , Raimundo Saona , Bruno Ziliotto

We present a method to detect quantum memory in a non-Markovian process. We call a process Markovian when the environment does not provide a memory that retains correlations across different system-environment interactions. We define two…

Quantum Physics · Physics 2021-04-28 Christina Giarmatzi , Fabio Costa

We measure and quantify non-Markovian effects in IBM's Quantum Experience. Specifically, we analyze the temporal correlations in a sequence of gates by characterizing the performance of a gate conditioned on the gate that preceded it. With…

Quantum Physics · Physics 2023-01-23 Joshua Morris , Felix A. Pollock , Kavan Modi

Consider the problem of predicting the next symbol given a sample path of length n, whose joint distribution belongs to a distribution class that may have long-term memory. The goal is to compete with the conditional predictor that knows…

Statistics Theory · Mathematics 2024-04-25 Yanjun Han , Tianze Jiang , Yihong Wu

An $\al$-permanental process $\{X_{ t},t\in T \}$ is a stochastic process determined by a kernel $K=\{K(s,t),s,t\in T \}$, with the property that for all $t_{1},\ldots,t_{n}\in T $, $ |I+K( t_{1},\ldots,t_{n}) S|^{- \al} $ is the Laplace…

Probability · Mathematics 2015-11-18 Michael B. Marcus , Jay Rosen

For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optimal cost, and moreover, it has the same dynamics as the…

Probability · Mathematics 2007-11-15 Arie Leizarowitz , Adam Shwartz

We study the redundancy of universally compressing strings $X_1,\dots, X_n$ generated by a binary Markov source $p$ without any bound on the memory. To better understand the connection between compression and estimation in the Markov…

Information Theory · Computer Science 2018-06-21 Changlong Wu , Maryam Hosseini , Narayana Santhanam

We derive a non-Markovian theory for waiting time distributions of consecutive single electron transfer events. The presented microscopic Pauli rate equation formalism couples the open electrodes to the many-body system, allowing to take…

Mesoscale and Nanoscale Physics · Physics 2015-05-14 Sven Welack , YiJing Yan

We present a numerical method to compute the approximation of the memory functions in the generalized Langevin models for collective dynamics of macromolecules. We first derive the exact expressions of the memory functions, obtained from…

Numerical Analysis · Mathematics 2015-06-19 Minxin Chen , Xiantao Li , Chun Liu

We consider a discrete time semi-Markov process where the characteristics defining the process depend on a small perturbation parameter. It is assumed that the state space consists of one finite communicating class of states and, in…

Probability · Mathematics 2016-03-21 Mikael Petersson

We consider killed Markov decision processes for countable models on a finite time-interval. Existence of a uniform $\varepsilon$-optimal policy is proven. We show the correctness of the fundamental equation. The optimal control problem is…

Optimization and Control · Mathematics 2013-04-10 Nestor Parolya , Yaroslav Yeleyko

The aim of this paper is to investigate the rebinding effect, a phenomenon describing a "short-time memory" which can occur when projecting a Markov process onto a smaller state space. For guaranteeing a correct mapping by the Markov State…

Numerical Analysis · Mathematics 2020-12-04 Susanne Röhl , Marcus Weber , Konstantin Fackeldey

The study of quantum dynamics featuring memory effects has always been a topic of interest within the theory of open quantum system, which is concerned about providing useful conceptual and theoretical tools for the description of the…

Quantum Physics · Physics 2020-08-25 Bassano Vacchini

We consider processes which are functions of finite-state Markov chains. It is well known that such processes are rarely Markov. However, such processes are often regular in the following sense: the distant past values of the process have…

Probability · Mathematics 2021-01-05 Steven Berghout , Evgeny Verbitskiy

For each $n\geq 1$, let $ {X_{in}, \quad i \geq 1} $ be independent copies of a nonnegative continuous stochastic process $X_{n}=(X_n(t))_{t\in T}$ indexed by a compact metric space $T$. We are interested in the process of partial maxima…

Probability · Mathematics 2011-10-07 Clément Dombry , Frédéric Eyi-Minko

Semi-Markov processes are Markovian processes in which the firing time of the transitions is modelled by probabilistic distributions over positive reals interpreted as the probability of firing a transition at a certain moment in time. In…

Formal Languages and Automata Theory · Computer Science 2017-12-04 Mathias Ruggaard Pedersen , Nathanaël Fijalkow , Giorgio Bacci , Kim Guldstrand Larsen , Radu Mardare