Kemeny常数的组合视角及更多结论
A combinatorial perspective on the Kemeny constant and more
AI总结:
本文从组合视角研究Kemeny常数,通过证明一个与初始状态无关的生成函数恒等式,推广了Kemeny的经典结论,并推导出涉及首达时高阶矩的一系列新结果。
摘要:
设$M$为有限状态空间$V$上的不可约转移矩阵。对于转移矩阵为$M$的马尔可夫链$C=(C_k,k\geq 0)$,令$τ^{\geq 1}_u$表示$C$首次到达$u$的正时刻,$ρ$为$M$的唯一不变测度。Kemeny证明:若$X$独立于$C$且服从$ρ$分布,则$C$首次到达$X$的正时刻的期望值不依赖于链的初始状态,即所有值$(E(τ^{\geq 1}_X~|~C_0=u), u \in V)$均相等。\n本文证明该性质源自一个更具一般性的结论:生成函数$\sum_{v\in V}E(x^{τ_v^{\geq 1}}~|~C_0=u)\det(Id-xM^{(v)})$与初始状态$u$无关,其中$M^{(v)}$是从$M$中删除状态$v$对应的行和列后得到的矩阵。该生成函数中的因子包括:一是$τ^{\geq 1}_v$的概率生成函数,二是行列式序列$(det(Id-xM^{(v)}),v\in V)$,已知当$x=1$时,该序列与不变测度$(ρ_u,u\in V)$成正比。\n从该性质出发,我们推导出了若干进一步的结论,包括涉及$τ_X^{\geq 1}$高阶矩的关系式,这些结论本身具有独立的研究价值。
英文摘要:
Let $M$ be an irreducible transition matrix on a finite state space $V$. For a Markov chain $C=(C_k,k\geq 0)$ with transition matrix $M$, let $τ^{\geq 1}_u$ denote the first positive hitting time of $u$ by $C$, and $ρ$ the unique invariant measure of $M$. Kemeny proved that if $X$ is sampled according to $ρ$ independently of $C$, the expected value of the first positive hitting time of $X$ by $C$ does not depend on the starting state of the chain: all the values $(E(τ^{\geq 1}_X~|~C_0=u), u \in V)$ are equal. \par In this paper, we show that this property follows from a more general result: the generating function $\sum_{v\in V}E(x^{τ_v^{\geq 1}}~|~C_0=u)\det(Id-xM^{(v)})$ is independent of the starting state $u$, where $M^{(v)}$ is obtained from $M$ by deleting the row and column corresponding to the state $v$. The factors appearing in this generating function are: first, the probability generating function of $τ^{\geq 1}_v$, and second, the sequence of determinants $(det(Id-xM^{(v)}),v\in V),$ which, for $x=1$, is known to be proportional to the invariant measure $(ρ_u,u\in V)$. From this property, we deduce several further results, including relations involving higher moments of $τ_X^{\geq 1}$, which are of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。