Q-矩阵第一特征值估计的Monte Carlo方法

本文对给定的可逆马氏链所对应的 Q-矩阵给出了它的第一非零特征值的 Monte Carlo估计方法 .具体做法是通过增加一个状态构造一个新的可逆马氏链 ,然后利用增加状态的击中时分布去估计第一非零特征值 .     

Markov chains with almost exponential hitting times

If a Markov chain converges rapidly to stationarity, then the time until the first hit on a rarely-visited set of states is approximately exponentially distributed; moreover an explicit bound for the error in this approximation can be given. This complements results of Keilson.     

层次模型Markov链的观测与统计

对于连续时间的层次模型M arkov链,所有的转移速率都可以由最底层状态的逗留时间和击中时间分布惟一决定,因而整个M arkov链的统计性质由它们的统计所决定.并给出了相应的算法和数例.     

Hitting time in a finite non-homogeneous Markov chain with applications

This paper deals with the computation of the hitting time for a non-homogeneous discrete time Markov chain (NHDTMC or NHMC). We first give the basic definitions of NHMC, then we analyse the hitting time and its survivor function. We also give the sufficient conditions for the existence of the mean hitting time. Finally, a numerical example and an application of this development in reliability evaluation are given in order to illustrate our results. © 1998 John Wiley & Sons, Ltd.     

Ergodic degrees for continuous-time Markov chains

This paper studies the existence of the higher orders deviation matrices for continuous time Markov chains by the moments for the hitting times. An estimate of the polynomial convergence rates for the transition matrix to the stationary measure is obtained. Finally, the explicit formulas for birth-death processes are presented.     

用奇异值分解方法计算具有重特征值矩阵的特征矢量

若当(Jordan)形是矩阵在相似条件下的一个标准形,在代数理论及其工程应用中都具有十分重要的意义．针对具有重特征值的矩阵,提出了一种运用奇异值分解方法计算它的特征矢量及若当形的算法．大量数值例子的计算结果表明,该算法在求解具有重特征值的矩阵的特征矢量及若当形上效果良好,优于商用软件MATLAB和MATHEMATICA．     

广义谱分解与亏损矩阵幂的算法

提出了亏损矩阵广义谱分解概念,所得广义特征矩阵具有类似若当链的性质AA(h)i=λiA(h)i+A(h+1)i.亏损矩阵可分解成A=∑si=1(λiA(0)i+A(1)i),由Am=∑si=1∑mh=0Chmλm-hiA(h)i可生成线性方程组,求出各A(h)i,进而计算A的较大次幂Am.介绍了广义谱分解在计算矩阵幂级数中的应用.     

A survey on retrial queues

Queueing systems in which arriving customers who find all servers and waiting positions (if any) occupied may retry for service after a period of time are called retrial queues or queues with repeated orders. Retrial queues have been widely used to model many problems in telephone switching systems, telecommunication networks, computer networks and computer systems. In this paper, we discuss some important retrial queueing models and present their major analytic results and the techniques used. Our concentration is mainly on single-server queueing models. Multi-server queueing models are briefly discussed, and interested readers are referred to the original papers for details. We also discuss the stochastic decomposition property which commonly holds in retrial queues and the relationship between the retrial queue and the queue with server vacations.     

金融租赁公司流动性风险研究

为研究金融租赁公司流动性风险,本文首次建立租赁公司现金流过程的多期动态模型,利用该模型定量分析了初始备付金、到期借款续借率和回收租金三个变量对公司流动性风险的影响。随后用违约概率来度量流动性风险,将问题转化成求解状态空间不断增大的非齐次马尔可夫链首中时的概率分布,并设计出违约算法(DA)和蒙特卡洛方法(MC)两种求解首中时分布的算法。算例表明提高初始备付金额度、到期借款续借率以及租金额度能有效地降低流动性风险。最后将银行的存贷利率和不同的租金定价方法融入基本模型,并通过三种不同的租金定价方式进一步分析了承租人信用风险对金融租赁公司流动性风险的影响。     

Choosing a random spanning subtree: a case study

Broder⁽⁴⁾ has suggested a stochastic algorithm for generating a random spanning subtree of a graph. This paper studies this algorithm for a special class of graphs. A complete spectral decomposition of the associated Markov chain is given. The analysis available from this is compared to stopping-time techniques and purely geometric bounds on the second eigenvalue.     

从x出发的漂移Brownian Motion的极值分布

该文研究了从x出发的正漂移Brownian Motion的极值问题，给出了关于这种随机过程的两种极大值的定义，并主要利用Brownian Motion的一些重要性质，比如正交不变性、时空齐次性及在有限停时上的强Markov性等，获得了两种极大值的分布函数的精确表达式。     

On the lifetime of a random binary sequence

Consider a system with m elements which is used to fulfill tasks. Each task is sent to one element which fulfills a task and the outcome is either fulfillment of the task (“1”) or the failure of the element (“0”). Initially, m tasks are sent to the system. At the second step, a complex of length m₁ is formed and sent to the system, where m₁ is the number of tasks fulfilled at the first step, and so on. The process continues until all elements fail and the corresponding waiting time defines the lifetime of the binary sequence which consists of “1” or “0”. We obtain a recursive equation for the expected value of this waiting time random variable.     

Applying Brownian motion to the study of birth-death chains

Basic properties of Brownian motion are used to derive two results concerning birth-death chains. First, the probability of extinction is calculated. Second, sufficient conditions on the transition probabilities of a birth-death chain are given to ensure that the expected value of the chain converges to a limit. The theory of Brownian motion local time figures prominently in the proof of the second result.     

一致椭圆扩散过程的几类极大游程

本文研究了暂留一致椭圆扩散过程，利用强Markov性，求出了在首中此球之前、末离此球之前和在首中此球与末离此球之间过程的几类极大游程的分布的估计，推广了文献、相关的结果．