2000 character limit reached
Discrete Capacity and Higher-order Differences of Two-state Markov Chains
Published 21 Jun 2016 in math.PR | (1606.06760v2)
Abstract: The paper studies the time-homogeneous two-state Markov chains; the states are assumed to be binary symbols 0 and 1. The higher-order absolute differences taken from progressive states of a given chain are considered. A discrete capacity of subsets of natural series is defined and a limiting theorem for these differences, formulated in terms of Wiener criterion type relation, is presented.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.