Convergence of a queueing system in heavy traffic with general patience-time distributions

We analyze a sequence of single-server queueing systems with impatient customers in heavy traffic. Our state process is the offered waiting time, and the customer arrival process has a state dependent intensity. Service times and customer patient-times are independent; i.i.d. with general distributions subject to mild constraints. We establish the heavy traffic approximation for the scaled offered waiting time process and obtain a diffusion process as the heavy traffic limit. The drift coefficient of this limiting diffusion is influenced by the sequence of patience-time distributions in a non-linear fashion. We also establish an asymptotic relationship between the scaled version of offered waiting time and queue-length. As a consequence, we obtain the heavy traffic limit of the scaled queue-length. We introduce an infinite-horizon discounted cost functional whose running cost depends on the offered waiting time and server idle time processes. Under mild assumptions, we show that the expected value of this cost functional for the n-th system converges to that of the limiting diffusion process as n tends to infinity.     

Electrochromism in Hf-doped WO3

Journal of Solid State Electrochemistry - In the present work, we analyzed the electrochromic behavior of tungsten oxide (WO3) and effect of hafnium (Hf) doping on its performance. The...     

Long time asymptotics for constrained diffusions in polyhedral domains

We study long time asymptotic properties of constrained diffusions that arise in the heavy traffic analysis of multiclass queueing networks. We first consider the classical diffusion model with constant coefficients, namely a semimartingale reflecting Brownian motion (SRBM) in a d$d$-dimensional positive orthant. Under a natural stability condition on a related deterministic dynamical system [P. Dupuis, R.J. Williams, Lyapunov functions for semimartingale reflecting brownian motions, Annals of Probability 22 (2) (1994) 680–702] showed that an SRBM is ergodic. We strengthen this result by establishing geometric ergodicity for the process. As consequences of geometric ergodicity we obtain finiteness of the moment generating function of the invariant measure in a neighborhood of zero, uniform time estimates for polynomial moments of all orders, and functional central limit results. Similar long time properties are obtained for a broad family of constrained diffusion models with state dependent coefficients under a natural condition on the drift vector field. Such models arise from heavy traffic analysis of queueing networks with state dependent arrival and service rates.     

A survey of numerical methods for nonlinear filtering problems

The main goal of filtering is to obtain, recursively in time, good estimates of the state of a stochastic dynamical system based on noisy partial observations of the same. In settings where the signal/observation dynamics are significantly nonlinear or the noise intensities are high, an extended Kalman filter (EKF), which is essentially a first order approximation to an infinite dimensional problem, can perform quite poorly: it may require very frequent re-initializations and in some situations may even diverge. The theory of nonlinear filtering addresses these difficulties by considering the evolution of the conditional distribution of the state of the system given all the available observations, in the space of probability measures. We survey a variety of numerical schemes that have been developed in the literature for approximating the conditional distribution described by such stochastic evolution equations; with a special emphasis on an important family of schemes known as the particle filters. A numerical study is presented to illustrate that in settings where the signal/observation dynamics are non linear a suitably chosen nonlinear scheme can drastically outperform the extended Kalman filter.     

Direction-Projection-Permutation for High-Dimensional Hypothesis Tests

High-dimensional low sample size (HDLSS) data are becoming increasingly common in statistical applications. When the data can be partitioned into two classes, a basic task is to construct a classifier that can assign objects to the correct class. Binary linear classifiers have been shown to be especially useful in HDLSS settings and preferable to more complicated classifiers because of their ease of interpretability. We propose a computational tool called direction-projection-permutation (DiProPerm), which rigorously assesses whether a binary linear classifier is detecting statistically significant differences between two high-dimensional distributions. The basic idea behind DiProPerm involves working directly with the one-dimensional projections of the data induced by binary linear classifier. Theoretical properties of DiProPerm are studied under the HDLSS asymptotic regime whereby dimension diverges to infinity while sample size remains fixed. We show that certain variations of DiProPerm are consistent and that consistency is a nontrivial property of tests in the HDLSS asymptotic regime. The practical utility of DiProPerm is demonstrated on HDLSS gene expression microarray datasets. Finally, an empirical power study is conducted comparing DiProPerm to several alternative two-sample HDLSS tests to understand the advantages and disadvantages of each method.     

<Emphasis Type="Italic">V</Emphasis>-uniform ergodicity for state-dependent single class queueing networks

We consider single class queueing networks with state-dependent arrival and service rates. Under the uniform (in state) stability condition, it is shown that the queue length process is V-uniformly ergodic; that is, it has a transition probability kernel which converges to its limit geometrically quickly in the V-norm sense. Among several asymptotic properties of V-uniformly ergodic processes, we present a Strassen-type functional law of the iterated logarithm result.