一类与凸函数有关的不等式的概率证法

通过构造随机变量的方法,并结合凸函数的性质,证明了数学分析中的一些著名不等式,证明方法简明、独特.     

尾年金分布的存在性和结构

本文主要是在年金分布的基础上, 推广、定义并研究了一类$r$尾年金分布的存在性和结构, 给出了这类分布的存在性条件, 证明了在一定条件下, $r$尾年金分布是年金分布与某一特殊$r$尾年金分布的混合.     

价格与隐含远期违约概率

如同根据布莱克-斯科尔斯模型从欧式看涨期权市场价格中反求隐含波动率一样,从信用违约互换的价格中提取隐含违约概率在理论上和实践上都存在很多困难.传统的自助法存在很大的缺点,并有可能得出不符合现实的结果.本文采用基于一段时期的条件违约概率的新的优化方法来替代基于自助法的瞬时远期违约概率,该方法有很多优良特性,会得出比传统方法好得多的结论.     

On classical analogues of free entropy dimension

We define a classical probability analogue of Voiculescu's free entropy dimension that we shall call the classical probability entropy dimension of a probability measure on Rn. We show that the classical probability entropy dimension of a measure is related with diverse other notions of dimension. First, it can be viewed as a kind of fractal dimension. Second, if one extends Bochner's inequalities to a measure by requiring that microstates around this measure asymptotically satisfy the classical Bochner's inequalities, then we show that the classical probability entropy dimension controls the rate of increase of optimal constants in Bochner's inequality for a measure regularized by convolution with the Gaussian law as the regularization is removed. We introduce a free analogue of the Bochner inequality and study the related free entropy dimension quantity. We show that it is greater or equal to the non-microstates free entropy dimension.     

Discrete-time GI/Geo/1 queue with multiple working vacations

Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method, we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.      

Algorithmic analysis of theMAP/PH/1 retrial queue

In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some interesting numerical examples are presented.     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

How likely is Polya's drunkard to stay in x⩾ y⩾z?

In his celebrated paper, Polya has considered the random walk in the three-dimensional (cubic) lattice and showed that the probability of return to the origin is less than 1. Subsequent authors have shown that the probability is %34.053.... Here we consider the same random walk, with the restriction that the drunkard is only allowed to stay inxyz. It is shown that his probability of returning to the originand staying in the allowed region is %6.4844....     

Corrigendum to “EuBaFe2O5+w: Valence mixing and charge ordering are two separate cooperative phenomena” [J. Solid State Chem. 180 (2007) 148-157]

An error in the expression for the Fe²⁺, Fe³⁺ valence-mixing probability in RBaFe₂O_5+w is acknowledged and correct formula is derived. The new formula slightly improves the least-squares fit to the experimental concentrations of the Mössbauer component Fe^2.5+ as a function of the oxygen-nonstoichiometry parameter w for R=Eu.     

A subjective Bayesian approach to the theory of queues II — Inference and information in M/M/1 queues

This is a sequel to Part I of A Subjective Bayesian Approach to the Theory of Queues. The focus here is on inference and a use of Shannon's measure of information for assessing the amount of information conveyed by the various types of data from queues. The notation and terminology used here is established in Part I.