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.     

Molecular mechanics study of zirconocenium catalyzed isospecific polymerization of propylene

Stereocontrol energy (ΔE⁰) is investigated as a measure of enantioselectivity of ansa-zircoocenium catalyst in propylene polymerization; it was calculated with MM2 (molecular mechanics) force field using π complex (°C) and transition state (TS) geometries obtained by ab initio molecular orbital methods. Both rac-ethylenebis (1-η⁵-indenyl) - ( 1 ) and rac-ethylenebis (1-η⁵-4,5,7,8-tetrahydroindenyl) ( 2 ) zirconocenium species are isospecific in either the π-complexes or the transition states. The stereoselectivity is greater if there is α-agostic interaction; it is lowered in the cases of β and γ agostic interactions. The ¹³C-NMR steric pentad distribution indicates the poly(propylene) to be much less stereoregular than that predicted by ΔE⁰. Following the occurrence of a regiochemical insertion error, the addition of another monomer via any mode is prohibitively unfavorable. The catalyst suffers loss of stereospecificity as temperature of polymerization increases. Insertion via transition states involving different agostic interactions could be one explanation for the observed loss. © 1995 John Wiley & Sons, Inc.     

非对称碰撞约束下形状记忆合金梁的随机响应与分岔

形状记忆合金(SMA)是二十一世纪具有形状记忆效应的新型智能材料.针对具有非对称约束的SMA梁,本文构造了碰撞振动系统.在无碰撞和有碰撞两种情况下,利用随机平均法给出了近似解析结果.数值模拟作为验证解析结果的工具.结果表明,系统能量的概率响应曲线具有非光滑特性.当约束位置发生变化时,系统会出现随机P分岔和D分岔.     

Asymptotic behavior of basic contact process with rapid stirring

In this paper we consider the basic contact process with infection rate λ and stirring rateD. We study the asymptotic behavior of the critical value and survival probability asD→∞.     

Uniqueness and clustering properties of Gibbs states for classical and quantum unbounded spin systems

We consider quantum unbounded spin systems (lattice boson systems) in -dimensional lattice space Z. Under appropriate conditions on the interactions we prove that in a region of high temperatures the Gibbs state is unique, is translationally invariant, and has clustering properties. The main methods we use are the Wiener integral representation, the cluster expansions for zero boundary conditions and for general Gibbs state, and explicitly -dependent probability estimates. For one-dimensional systems we show the uniqueness of Gibbs states for any value of temperature by using the method of perturbed states. We also consider classical unbounded spin systems. We derive necessary estimates so that all of the results for the quantum systems hold for the classical systems by straightforward applications of the methods used in the quantum case.     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.     

Second-order properties of the loss probability inM/M/s/s +c systems

The Erlang loss function, which gives the steady state loss probability in anM/M/s/s system, has been extensively studied in the literature. In this paper, we look at the similar loss probability inM/M/s/s + c systems and an extension of it to nonintegral number of servers and queue capacity. We study its monotonicity properties. We show that the loss probability is convex in the queue capacity, and that it is convex in the traffic intensity if is below some ^* and concave if is greater that ^*, for a broad range of number of servers and queue capacities. We prove that the one-server loss system is the onlyM/M/s/s +c system for which the loss probability is concave in the traffic intensity in all its range.Research supported by Grant BD/645/90-RM from Junta Nacional de Investigação Científica e Tecnológica.On leave from: Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1096 Lisboa Codex, Portugal.