齐次马氏链的Zipf与非Zipf律
Zipf and non-Zipf Laws for Homogeneous Markov Chain
摘要:
考虑一个具有离散时间的齐次马氏链,它具有一个有限的状态集$E_0,\ldots,E_n$,使得状态$E_0$是吸收的,状态$E_1,\ldots,E_n$是非回归的.这项工作的目标是研究频率的轨迹在这个链,即,由符号$E_1,\ldots,E_n$组成的“单词”,以“空格”$E_0$结尾。让我们根据单词的概率对单词进行排序;用$p(t)$表示列表中第$t$个单词的概率。本文证明了函数$p(t)$的渐近性在一个典型情况下具有幂特征,并由转移概率矩阵定义了它的指数。如果这个矩阵是块对角的,那么对于一些特定的转移概率值,幂渐近性得到(对数)adjacent。但如果这个矩阵相当稀疏,那么概率会迅速下降;也就是说,渐近的速度大于幂1,但不大于指数1。我们还建立了指数级下降的必要条件和充分条件,并得到了一个公式,确定指数的转移概率矩阵和初始分布向量。
英文摘要:
Let us consider a homogeneous Markov chain with discrete time and with a finite set of states $E_0,\ldots,E_n$ such that the state $E_0$ is absorbing, states $E_1,\ldots,E_n$ are nonrecurrent. The goal of this work is to study frequencies of trajectories in this chain, i.e., "words" composed of symbols $E_1,\ldots,E_n$ ending with the "space" $E_0$. Let us order words according to their probabilities; denote by $p(t)$ the probability of the $t$th word in this list. In this paper we prove that in a typical case the asymptotics of the function $p(t)$ has a power character, and define its exponent from the matrix of transition probabilities. If this matrix is block-diagonal, then with some specific values of transition probabilities the power asymptotics gets (logarithmic) addends. But if this matrix is rather sparse, then probabilities quickly decrease; namely, the rate of asymptotics is greater than that of the power one, but not greater than that of the exponential one. We also establish necessary and sufficient conditions for the exponential order of decrease and obtain a formula for determining the exponent from the transition probability matrix and the initial distribution vector.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。