منابع مشابه
Finite-State Markov Chains for Multiple Sequences
We consider the analysis of sets of categorical sequences consisting of piecewise homogeneous Markov segments. The sequences are assumed to be governed by a common underlying process with segments occurring in the same order for each sequence. Segments are defined by a set of unobserved changepoints where the positions and number of changepoints can vary from sequence to sequence. We propose a ...
متن کاملContinuum Limits of Markov Chains with Application to Network Modeling
In this paper we investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model very large networks. We show that under some conditions, a sequence of Markov chains converges in some sense to the solution of a partial differential equation. Based on such convergence we approximate Markov chains modeling networks with a large nu...
متن کاملContinuum Limits of Markov Chains with Application to Wireless Network
We investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model networks with a very large number of nodes. We show that a sequence of such Markov chains indexed by N , the number of components in the system that they model, converges in a certain sense to its continuum limit, which is the solution of a partial differential e...
متن کاملSelf-similar scaling limits of non-increasing Markov chains
We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We show that the chain starting from n and appropriately rescaled, converges in distribution, as n → ∞, to a non-increasing self-similar Markov process. This c...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2015
ISSN: 1083-6489
DOI: 10.1214/ejp.v20-4188