An overview of Brownian and non-Brownian FCLTs for the single-server queue

We review functional central limit theorems (FCLTs) for the queue-content process in a single-server queue with finite waiting room and the first-come first-served service discipline. We emphasize alternatives to the familiar heavy-traffic FCLTs with reflected Brownian motion (RBM) limit process that arise with heavy-tailed probability distributions and strong dependence. Just as for the familiar convergence to RBM, the alternative FCLTs are obtained by applying the continuous mapping theorem with the reflection map to previously established FCLTs for partial sums. We consider a discrete-time model and first assume that the cumulative net-input process has stationary and independent increments, with jumps up allowed to have infinite variance or even infinite mean. For essentially a single model, the queue must be in heavy traffic and the limit is a reflected stable process, whose steady-state distribution can be calculated by numerically inverting its Laplace transform. For a sequence of models, the queue need not be in heavy traffic, and the limit can be a general reflected Lévy process. When the Lévy process representing the net input has no negative jumps, the steady-state distribution of the reflected Lévy process again can be calculated by numerically inverting its Laplace transform. We also establish FCLTs for the queue-content process when the input process is a superposition of many independent component arrival processes, each of which may exhibit complex dependence. Then the limiting input process is a Gaussian process. When the limiting net-input process is also a Gaussian process and there is unlimited waiting room, the steady-state distribution of the limiting reflected Gaussian process can be conveniently approximated. This revised version was published online in June 2006 with corrections to the Cover Date.     

Engen's extended negative binomial model revisited

The present article shows that a limiting argument that is essentially the law of small numbers produces a proper discrete multivariate distribution from any generalized Poisson distribution. Based on this result, Engen's Extended Negative Binomial (ENB) model is derived from the Poisson-Pascal distribution, which is a generalization of the inverse Gaussian-Poisson distribution. The ENB model is also derived from Sichel's generalized inverse Gaussian-Poisson distribution. The application of the ENB model is discussed thereto.     

Equivalence of measures induced by infinitely divisible processes

We find sufficient conditions for the equivalence of two measures on function space induced by infinitely divisible processes. The processes are not assumed to be stochastically continuous or to have independent increments. The theorem proved here is equivalent to known results in the special case of stochastically continuous processes with independent increments.     

Stationary Analysis of a Fluid Queue Driven by Some Countable State Space Markov Chain

Motivated by queueing systems playing a key role in the performance evaluation of telecommunication networks, we analyze in this paper the stationary behavior of a fluid queue, when the instantaneous input rate is driven by a continuous-time Markov chain with finite or infinite state space. In the case of an infinite state space and for particular classes of Markov chains with a countable state space, such as quasi birth and death processes or Markov chains of the G/M/1 type, we develop an algorithm to compute the stationary probability distribution function of the buffer level in the fluid queue. This algorithm relies on simple recurrence relations satisfied by key characteristics of an auxiliary queueing system with normalized input rates.      

Networks of infinite-server queues with nonstationary Poisson input

In this paper we focus on networks of infinite-server queues with nonhomogeneous Poisson arrival processes. We start by introducing a more general Poisson-arrival-location model (PALM) in which arrivals move independently through a general state space according to a location stochastic process after arriving according to a nonhomogeneous Poisson process. The usual open network of infinite-server queues, which is also known as a linear population process or a linear stochastic compartmental model, arises in the special case of a finite state space. The mathematical foundation is a Poisson-random-measure representation, which can be obtained by stochastic integration. It implies a time-dependent product-form result: For appropriate initial conditions, the queue lengths (numbers of customers in disjoint subsets of the state space) at any time are independent Poisson random variables. Even though there is no dependence among the queue lengths at each time, there is important dependence among the queue lengths at different times. We show that the joint distribution is multivariate Poisson, and calculate the covariances. A unified framework for constructing stochastic processes of interest is provided by stochastically integrating various functionals of the location process with respect to the Poisson arrival process. We use this approach to study the flows in the queueing network; e.g., we show that the aggregate arrival and departure processes at a given queue (to and from other queues as well as outside the network) are generalized Poisson processes (without necessarily having a rate or unit jumps) if and only if no customer can visit that queue more than once. We also characterize the aggregate arrival and departure processes when customers can visit the queues more frequently. In addition to obtaining structural results, we use the stochastic integrals to obtain explicit expressions for time-dependent means and covariances. We do this in two ways. First, we decompose the entire network into a superposition of independent networks with fixed deterministic routes. Second, we make Markov assumptions, initially for the evolution of the routes and finally for the entire location process. For Markov routing among the queues, the aggregate arrival rates are obtained as the solution to a system of input equations, which have a unique solution under appropriate qualifications, but not in general. Linear ordinary differential equations characterize the time-dependent means and covariances in the totally Markovian case.     

Analysis of a Discrete-Time Queueing System with a Single Server and Heterogeneous Markovian Arrivals

We consider a discrete-time queueing system with a single deterministic server, heterogeneous Markovian arrivals and finite capacity. Most existing techniques model the queueing system using a direct bivariate Markov chain which requires a state space that grows rapidly as the number of customer types increases. In this paper, we define renewal cycles in terms of the input process and model the system occupancy level on each renewal cycle using a one-dimensional Markov chain. We derive the exact joint steady-state probability distribution of both states of input and system occupancy with a considerably reduced state space, which leads to the efficient calculation of overall/individual performance measures such as loss probability and average delay.     

State space models on special manifolds

This paper concerns modeling time series observations in state space forms considered on the Stiefel and Grassmann manifolds. We develop a state space model relating the time series observations to a sequence of unobserved state or parameter matrices assuming the matrix Langevin noise processes on the Stiefel manifolds. We show a Bayes method for estimating the state matrices by the posterior modes. We consider a further extended state space model where two sequences of unobserved state matrices are involved. A simple state space model on the Grassmann manifolds with matrix Langevin noise processes is also investigated.     

The age of a Markov process

The concept of a limiting conditional age distribution of a continuous time Markov process whose state space is the set of non-negative integers and for which {0} is absorbing is defined as the weak limit as t→∞ of the last time before t an associated “return” Markov process exited from {0} conditional on the state, j, of this process at t. It is shown that this limit exists and is non-defective if the return process is ρ-recurrent and satisfies the strong ratio limit property. As a preliminary to the proof of the main results some general results are established on the representation of the ρ-invariant measure and function of a Markov process. The conditions of the main results are shown to be satisfied by the return process constructed from a Markov branching process and by birth and death processes. Finally, a number of limit theorems for the limiting age as j→∞ are given.     

A characterization of mixing processes of type G1

A stationary Gaussian process is mixing if and only if its covariance function tends to zero as the lag increases to infinity. We give an analogous characterization for a large class of symmetric infinitely divisible processes, known as processes of type G, whose marginal distribution are variance mixtures of the normal distribution.The first author is also associated with the Hugo Steinhaus Center for Stochastic Methods, Poland. The second author was partially supported by the ONR Grant N00014-90-J-1287 at Boston University and by a grant of the United States-Israel Binational Science Foundation.     

On stochastic processes in a multilevel control bulk queueing system

This article analyzes some stochastic processes that arise in a bulk single server queue with continuously operating server, state dependent compound Poisson input flow and general state dependent service process. The authors treat the queueing process as a semi–regenerative process and obtain the invariant probability measure and the transient distribution for the embedded Markov chain. The stationary probability measure for the queueing process with continuous time parameter is found by using semi-regenerative techniques. The authors also study the input and output processes and establish ergodic theorems for some functionals of these processes. The results are obtained in terms of the invariant probability measure for the embedded process and the stationary measure for the queueing process with continuous time parameter     

The Equivalence of Ergodicity and Weak Mixing for Infinitely Divisible Processes

The equivalence of ergodicity and weak mixing for general infinitely divisible processes is proven. Using this result and [9], simple conditions for ergodicity of infinitely divisible processes are derived. The notion of codifference for infinitely divisible processes is investigated, it plays the crucial role in the proofs but it may be also of independent interest.     

Existence of equilibrium for economies with infinitely many commodities and infinitely countable consumers

This paper examines the existence of equilibria for double infinite eonomies. S.F. Richard and S. Srivastava have established the existence of equilibria for economies with infinitely countable consumers when commodity space isL ^∞ (M, M, μ). However, most Banach Lattices as commodity spaces haven’t interior points in their positive cones, so their result can’t be applied to many cases. We here consider a general Banach Lattice as commodity space and introduce a concept of equiproperness on preferences. Under the assumption the existence of equilibrium for economy is established. Finally, we examine the existence of equilibria for production economies.     

A representation theory for the impulse control of jump processes

A state space representation theory for the impulse control of a quite general class of non-Markov jump processes is developed. Control decisions are based upon observations of past histories of an input jump process and observations of the current state of the corresponding controlled output. A verification theorem establishes that a solution of a system of quasi variational inequalities gives rise naturally to an optimal impulse policy. The proof of optimality relies upon an extended version of the well-known Dynkin formula for Markov processes.     

Mean field analysis of neural networks: A central limit theorem

We rigorously prove a central limit theorem for neural network models with a single hidden layer. The central limit theorem is proven in the asymptotic regime of simultaneously (A) large numbers of hidden units and (B) large numbers of stochastic gradient descent training iterations. Our result describes the neural network’s fluctuations around its mean-field limit. The fluctuations have a Gaussian distribution and satisfy a stochastic partial differential equation. The proof relies upon weak convergence methods from stochastic analysis. In particular, we prove relative compactness for the sequence of processes and uniqueness of the limiting process in a suitable Sobolev space.     

具有平均费用的非平稳Markov决策过程

本文研究了在一般状态空间具有平均费用的非平稳Ｍａｒｋｏｖ决策过程，把在平稳情形用补充的折扣模型的最优方程来建立平均费用的最优方程的结果，推广到非平稳的情形．利用这个结果证明了最优策略的存在性．     

Limiting distribution for a simple model of order book dynamics

A continuous-time model for the limit order book dynamics is considered. The set of outstanding limit orders is modeled as a pair of random counting measures and the limiting distribution of this pair of measure-valued processes is obtained under suitable conditions on the model parameters. The limiting behavior of the bid-ask spread and the midpoint of the bid-ask interval are also characterized.     

An asymptotic decomposition for multivariate distribution-free tests of independence

In the multivariate case, the empirical dependence function, defined as the empirical distribution function with reduced uniform margins on the unit interval, can be shown for an i.i.d. sequence to converge weakly in an asymptotic way to a limiting Gaussian process. The main result of this paper is that this limiting process can be canonically separated into a finite set of independent Gaussian processes, enabling one to test the existence of dependence relationships within each subset of coordinates independently (in an asymptotic way) of what occurs in the other subsets. As an application we derive the Karhunen-Loeve expansions of the corresponding processes and give the limiting distribution of the multivariate Cramer-Von Mises test of independence, generalizing results of Blum, Kiefer, Rosenblatt, and Dugué. Other extensions are mentioned, including a generalization of Kendall's τ.     

A queueing system with random server capacity and multiple control

The authors study queueing, input and output processes in a queueing system with bulk service and state dependent service delay. The input flow of customers, modulated by a semi-Markov process, is served by a single server that takes batches of a certain fixed size if available or waits until the queue accumulates enough customers for service. In the latter case, the batch taken for service is of random size dependent on the state of the system, while service duration depends both on the state of the system and on the batch size taken. The authors establish a necessary and sufficient condition for equilibrium of the system and obtain the following results: Explicit formulas for steady state distribution of the queueing process, intensity of the input and output processes, and mean values of idle and busy periods. They employ theory of semi-regenerative processes and illustrate the results by a number of examples. In one of them an optimization problem is discussed.