The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For an irreducible and aperiodic Markov Chain, the channel is forgetful, and one retrieves the known expression [15] for the capacity. For the more general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the capacity is expresse...

In this short note we show that for a Markovian open quantum system it is always possible to construct a unique set of perfectly consistent Schmidt paths, supporting quasi-classicality. Our Schmidt process, elaborated several years ago, is the ∆t → 0 limit of the Schmidt chain constructed very recently by Paz and Zurek.

Overlap of words complicates the problem of word counting. The technique of the imbedded Markov chain (IMC) uses an enlarged state space to recover the Markovian property for the word counting problem. A degenerate word represents multiple non-degenerate words. An efficient way to decompose a degenerate word according to its overlapping pattern for implementing IMC is proposed.

An edge coding scheme based on chain code representation in a multiresolution image coding context is presented. Our method enhances the coding schemes that describe the source structure with Markov models, by using also an a priori knowledge from the previous decoded resolution images. Experiments using adaptive arithmetic coding have shown up to a 5% improvement for the bitrate compared to a ...

We construct a strongly minimal set which is not a finite cover of one with DMP. We also prove that for a strongly minimal theory T generic automorphisms exist iff T has DMP, thus proving a conjecture of Kikyo and

The first-passage time, defined as the time a random walker takes to reach a target point in a confining domain, is a key quantity in the theory of stochastic processes. Its importance comes from its crucial role in quantifying the efficiency of processes as varied as diffusion-limited reactions, target search processes or the spread of diseases. Most methods of determining the properties of fi...

In this paper, we develop a new“robust mixing” framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducible Markov Chain with stationary distribution π. An adversary announces a sequence of stochastic matrices {At}t>0 satisfying πAt = π. An AMMC process involves an application of P followed by At at time t. The robust mixing time of...

Why some strains of a species exhibit a certain phenotype (e.g. drug resistant) but not the other strains of the same species is a critical question to answer. Studying the metabolism of the two groups of strains may discover the corresponding pathways that are conserved in the first group but not in the second group. However, only a few tools provide functions to compare two groups of metaboli...

in this paper, absorbing markov chain models are developed to determine the optimum process mean levels for both a single-stage and a serial two-stage production system in which items are inspected for conformity with their specification limits. when the value of the quality characteristic of an item falls below a lower limit, the item is scrapped. if it falls above an upper limit, the item is ...