Functional limit theorems for Galton–Watson processes with very active immigration

We prove weak convergence on the Skorokhod space of Galton–Watson processes with immigration, properly normalized, under the assumption that the tail of the immigration distribution has a logarithmic decay. The limits are extremal shot noise processes. By considering marginal distributions, we recover the results of Pakes (1979).     

Functional limit theorems for renewal shot noise processes with increasing response functions

We consider renewal shot noise processes with response functions which are eventually nondecreasing and regularly varying at infinity. We prove weak convergence of renewal shot noise processes, properly normalized and centered, in the space D[0,∞)$D[0,\infty )$ under the _J1$J_1$ or _M1$M_1$ topology. The limiting processes are either spectrally nonpositive stable Lévy processes, including the Brownian motion, or inverse stable subordinators (when the response function is slowly varying), or fractionally integrated stable processes or fractionally integrated inverse stable subordinators (when the index of regular variation is positive). The proof exploits fine properties of renewal processes, distributional properties of stable Lévy processes and the continuous mapping theorem.     

The estimation of a nonlinear moving average model

We consider discrete-parameter stochastic processes that are the output of a nonlinear filter driven by white noise. For a simple model, we derive estimates of the unknown coefficients in the transfer function and the noise variance, and investigate their asymptotic properties. We prove some lemmas that can also be used to obtain rates of convergence in the weak and strong laws of large numbers, and central limit theorems, for estimates of more general nonlinear models.     

On Markov-Additive Jump Processes

In 1995, Pacheco and Prabhu introduced the class of so-called Markov-additive processes of arrivals in order to provide a general class of arrival processes for queueing theory. In this paper, the above class is generalized considerably, including time-inhomogeneous arrival rates, general phase spaces and the arrival space being a general vector space (instead of the finite-dimensional Euclidean space). Furthermore, the class of Markov-additive jump processes introduced in the present paper is embedded into the existing theory of jump processes. The best known special case is the class of BMAP arrival processes.     

Modeling financial asset returns with shot noise processes

We introduce a new class of continuous time processes for modeling the rate of returns of financial assets. The statistical characterization is based on the so-called shot noise processes. The probabilistic structure of the shot noise process provides a very realistic framework for asset returns modeling of the stock price processes. Our class of processes exhibits the natural phenomena well known in empirical financial studies:

1. (a) fat-tail distribution function for the asset returns,

2. (b) dependence of the returns,

3. (c) nonstationarity in time.

Financial asset returns in new emerging markets such as those of Eastern European countries exhibit a highly volatile behavior. Statistical investigations of the unconditional distribution of returns of stocks, commodities, exchange rates, etc., show extremely heavy tails and steep peaks around the expectation. We use a class of shot noise processes with Poissonian times and Brownian magnitudes for modeling this phenomenon.     

Multifractal detrended fluctuation analysis of analog random multiplicative processes

We investigate non-Gaussian statistical properties of stationary stochastic signals generated by an analog circuit that simulates a random multiplicative process with weak additive noise. The random noises are originated by thermal shot noise and avalanche processes, while the multiplicative process is generated by a fully analog circuit. The resulting signal describes stochastic time series of current interest in several areas such as turbulence, finance, biology and environment, which exhibit power-law distributions. Specifically, we study the correlation properties of the signal by employing a detrended fluctuation analysis and explore its multifractal nature. The singularity spectrum is obtained and analyzed as a function of the control circuit parameter that tunes the asymptotic power-law form of the probability distribution function.     

Exponential ergodicity and regularity for equations with Lévy noise

We prove exponential convergence to the invariant measure, in the total variation norm, for solutions of SDEs driven by α-stable noises in finite and in infinite dimensions. Two approaches are used. The first one is based on Liapunov’s function approach by Harris, and the second on Doeblin’s coupling argument in [8]. Irreducibility and uniform strong Feller property play an essential role in both approaches. We concentrate on two classes of Markov processes: solutions of finite dimensional equations, introduced in [27], with Hölder continuous drift and a general, non-degenerate, symmetric α-stable noise, and infinite dimensional parabolic systems, introduced in [29], with Lipschitz drift and cylindrical α-stable noise. We show that if the nonlinearity is bounded, then the processes are exponential mixing. This improves, in particular, an earlier result established in [28], with a different method.     

成批到达排队系统的随机比较

本文研究成批到达排队系统中队长过程的随机比较问题．利用随机比较方法我们对成批到达指数服务的多服务台排队系统进行分析,得到了该排队系统中队长过程的随机比较以及队长函数关于时间的凹性和凸性．同时我们也给出了成批到达一般服务的单服务台排队系统队长过程、稳态队长的随机比较以及队长函数关于时间的凹性和凸性．     

Tandem behavior of a telecommunication system with finite buffers and repeated calls

The tandem behavior of a telecommunication system with finite buffers and repeated calls is modeled by the performance of a finite capacityG/M/1 queueing system with general interarrival time distribution, exponentially distributed service time, the first-come-first-served queueing discipline and retrials. In this system a fraction of the units which on arrival at a node of the system find it busy, may retry to be processed, by merging with the incoming arrival units in that node, after a fixed delay time. The performance of this system in steady state is modeled by a queueing network and is approximated by a recursive algorithm based on the isolation method. The approximation outcomes are compared against those from a simulation study. Our numerical results indicate that in steady state the non-renewal superposition arrival process, the non-renewal overflow process, and the non-renewal departure process of the above system can be approximated with compatible renewal processes.     

Central limit theorem for functionals of a generalized self-similar Gaussian process

We consider a class of self-similar, continuous Gaussian processes that do not necessarily have stationary increments. We prove a version of the Breuer–Major theorem for this class, that is, subject to conditions on the covariance function, a generic functional of the process increments converges in law to a Gaussian random variable. The proof is based on the Fourth Moment Theorem. We give examples of five non-stationary processes that satisfy these conditions.     

Queue-length balance equations in multiclass multiserver queues and their generalizations

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: The distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a departure epoch. The constraint for this result to be valid is that arrivals, and also service completions, with probability one occur individually, i.e., not in batches. We show that it is easy to write down somewhat similar balance equations for multidimensional queue-length processes for a quite general network of multiclass multiserver queues. We formally derive those balance equations under a general framework. They are called distributional relationships and are obtained for any external arrival process and state-dependent routing as long as certain stationarity conditions are satisfied and external arrivals and service completions do not simultaneously occur. We demonstrate the use of these balance equations, in combination with PASTA, by (1) providing very simple derivations of some known results for polling systems and (2) obtaining new results for some queueing systems with priorities. We also extend the distributional relationships for a nonstationary framework.     

Towards better multi-class parametric-decomposition approximations for open queueing networks

Methods are developed for approximately characterizing the departure process of each customer class from a multi-class single-server queue with unlimited waiting space and the first-in-first-out service discipline. The model is (GT _i /GI _i )/1 with a non-Poisson renewal arrival process and a non-exponential service-time distribution for each class. The methods provide a basis for improving parametric-decomposition approximations for analyzing non-Markov open queueing networks with multiple classes. For example, parametric-decomposition approximations are used in the Queueing Network Analyzer (QNA). The specific approximations here extend ones developed by Bitran and Tirupati [5]. For example, the effect of class-dependent service times is considered here. With all procedures proposed here, the approximate variability parameter of the departure process of each class is a linear function of the variability parameters of the arrival processes of all the classes served at that queue, thus ensuring that the final arrival variability parameters in a general open network can be calculated by solving a system of linear equations.     

Heavy-traffic limits for an infinite-server fork–join queueing system with dependent and disruptive services

We study an infinite-server fork–join queueing system with dependent services, which experiences alternating renewal service disruptions. Jobs are forked into a fixed number of parallel tasks upon arrival and processed at the corresponding parallel service stations with multiple servers. Synchronization of a job occurs when its parallel tasks are completed, i.e., non-exchangeable. Service times of the parallel tasks of each job can be correlated, having a general continuous joint distribution function, and moreover, the service vectors of consecutive jobs form a stationary dependent sequence satisfying the strong mixing (\(\alpha \)-mixing) condition. The system experiences renewal alternating service disruptions with up and down periods. In each up period, the system operates normally, but in each down period, jobs continue to enter the system, while all the servers will stop working, and services received will be conserved and resume at the beginning of the next up period. We study the impact of both the dependence among service times and these down times upon the service dynamics, the unsynchronized queueing dynamics, and the synchronized process, assuming that the down times are asymptotically negligible. We prove FWLLN and FCLT for these processes, where the limit processes in the FCLT possess a stochastic decomposition property and the convergence requires the Skorohod \(M_1\) topology.     

Networks of $$\cdot /G/\infty $$ queues with shot-noise-driven arrival intensities

We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by a shot-noise process. A shot-noise rate emerges naturally in cases where the arrival rate tends to exhibit sudden increases (or shots) at random epochs, after which the rate is inclined to revert to lower values. Exponential decay of the shot noise is assumed, so that the queueing systems are amenable to analysis. In particular, we perform transient analysis on the number of jobs in the queue jointly with the value of the driving shot-noise process. Additionally, we derive heavy-traffic asymptotics for the number of jobs in the system by using a linear scaling of the shot intensity. First we focus on a one-dimensional setting in which there is a single infinite-server queue, which we then extend to a network setting.     

Traffic processes in a class of finite Markovian queues

This paper exposes the stochastic structure of traffic processes in a class of finite state queueing systems which are modeled in continuous time as Markov processes. The theory is presented for theM/E _k /φ/L class under a wide range of queue disciplines. Particular traffic processes of interest include the arrival, input, output, departure and overflow processes. Several examples are given which demonstrate that the theory unifies many earlier works, as well as providing some new results. Several extensions to the model are discussed.     

On the distributions of infinite server queues with batch arrivals

Queues that feature multiple entities arriving simultaneously are among the oldest models in queueing theory, and are often referred to as “batch” (or, in some cases, “bulk”) arrival queueing systems. In this work, we study the effect of batch arrivals on infinite server queues. We assume that the arrival epochs occur according to a Poisson process, with treatment of both stationary and non-stationary arrival rates. We consider both exponentially and generally distributed service durations, and we analyze both fixed and random arrival batch sizes. In addition to deriving the transient mean, variance, and moment-generating function for time-varying arrival rates, we also find that the steady-state distribution of the queue is equivalent to the sum of scaled Poisson random variables with rates proportional to the order statistics of its service distribution. We do so through viewing the batch arrival system as a collection of correlated sub-queues. Furthermore, we investigate the limiting behavior of the process through a batch scaling of the queue and through fluid and diffusion limits of the arrival rate. In the course of our analysis, we make important connections between our model and the harmonic numbers, generalized Hermite distributions, and truncated polylogarithms.

     

First crossing time,overshoot and Appell–Hessenberg type functions

We consider a general insurance risk model with extended flexibility under which claims arrive according to a point process with independent increments, their amounts may have any joint distribution and the premium income is accumulated following any non-decreasing, possibly discontinuous, real valued function. Point processes with independent increments are in general non-stationary, allowing for an arbitrary (possibly discontinuous) claim arrival cumulative intensity function which is appealing for insurance applications. Under these general assumptions, we derive a closed form expression for the joint distribution of the time to ruin and the deficit at ruin, which is remarkable, since as we show, it involves a new interesting class of what we call Appell–Hessenberg type functions. The latter are shown to coincide with the classical Appell polynomials in the Poisson case and to yield a new class of the so called Appell–Hessenberg factorial polynomials in the case of negative binomial claim arrivals. Corollaries of our main result generalize previous ruin formulas e.g. those obtained for the case of stationary Poisson claim arrivals.     

Limit non-stationary behavior of large closed queueing networks with bottlenecks

In this paper martingales methods are applied for analyzing limit non-stationary behavior of the queue length processes in closed Jackson queueing networks with a single class consisting of a large number of customers, a single infinite server queue, and a fixed number of single server queues with large state independent service rates. It is assumed that one of the single server nodes forms a bottleneck. For the non-bottleneck nodes we show that the queue length distribution at timet converges in generalized sense to the stationary distribution of the M/M/1 queue whose parameters explicitly depend ont. For the bottleneck node a diffusion approximation with reflection is proved in the moderate usage regime while fluid and Gaussian diffusion approximations are established for the heavy usage regime.