Abstract:

The paper studies the higher-order absolute differences taken from progressive terms of time-homogeneous binary Markov chains. Two theorems presented are the limiting theorems for these differences, when their order k converges to infinity. Theorems 1 and 2 assert that there exist some infinite subsets E of natural series such that kth order differences of every such chain converge to the equi-distributed random binary process as k growth to infinity remaining on E. The chains are classified into two types, and E depends only on the type of the given chain. Two kinds of discrete capacities for subsets of natural series are defined, and in their terms such sets E are described.

Identifier:

oai:noad.sci.am:135790

Language:

English

URL:

Additional Information:

svrdn@yerphi.am

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Conference title:

11th International Conference on Computer Science and Information Technologies CSIT 2017

Place:

Yerevan

Participation type:

oral