Optimal volume-corrected laplace-metropolis method

The article provides a refinement for the volume-corrected Laplace-Metropolis estimator of the marginal likelihood of DiCiccioet al. The correction volume of probability α in DiCiccioet al. is fixed and suggested to take the value α=0.05. In this article α is selected based on an asymptotic analysis to minimize the mean square relative error (MSRE). This optimal choice of α is shown to be invariant under linear transformations. The invariance property leads to easy implementation for multivariate problems. An implementation procedure is provided for practical use. A simulation study and a real data example are presented.     

保险公司离散型崩溃模型研究

本文提出并讨论了含投资因素、红利分配因素的崩溃模型，得出了关于崩溃概率、保险公司的期望寿命的结论，这些结论推广了没有考虑投资因素的崩溃模型的相关结论．     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.     

Surface effects in field-induced smectic transitions

We study the surface behavior of a semi-infinite smectogenic sample bounded by a solid wall, in the presence of an external electric field. Our analysis is performed in the framework of a Landau-de Gennes theory. For the sake of simplicity, we consider only the case in which, in the absence of field and surfaces, a direct isotropic to smectic-A transition occurs, while in the presence of the electric field a nonspontaneous nematic phase appears. Two new surface phases are identified, namely a parasmectic and a surface-induced smectic phase. The shifts in the transition temperatures and the critical behavior of the surface states are analyzed. Received: 25 August 1997 / Accepted: 23 January 1998     

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.