Related papers: On Exponential Ergodicity of Multiclass Queueing N…
We introduce a multiclass single-server queueing system in which the arrival rates depend on the current job in service. The system is characterized by a matrix of arrival rates in lieu of a vector of arrival rates. Our proposed model…
In this paper, we provide a review on the kernel method, which is one of the options for characterizing so-called exact tail asymptotic properties in stationary probabilities of two-dimensional random walks, discrete or continuous (or…
We study the one-dimensional branching random walk in the case when the step size distribution has a stretched exponential tail, and, in particular, no finite exponential moments. The tail of the step size $X$ decays as $\mathbb{P}[X \geq…
We study an optimal-control problem of polling systems with large switchover times, when a holding cost is incurred on the queues. In particular, we consider a stochastic network with a single server that switches between several buffers…
We investigate the tail behaviour of the steady state distribution of a stochastic recursion that generalises Lindley's recursion. This recursion arises in queuing systems with dependent interarrival and service times, and includes…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks.…
Identifying the generating mechanism of a network is challenging as, more often than not, only snapshots are available, but not the full evolution. One candidate for the generating mechanism is preferential attachment which, in its simplest…
Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current…
Generic short-range interacting quantum systems with a conserved quantity exhibit universal diffusive transport at late times. We employ non-equilibrium quantum field theory and semi-classical phase-space simulations to show how this…
Let Y be an Ornstein-Uhlenbeck diffusion governed by a stationary and ergodic Markov jump process X: dY_t=a(X_t)Y_t dt+\sigma(X_t) dW_t, Y_0=y_0. Ergodicity conditions for Y have been obtained. Here we investigate the tail propriety of the…
We obtain first decay rates of probabilities of tails of multivariate polynomials built on independent random variables with heavy tails. Then we derive stable limit theorems for nonconventional sums of the form $\sum_{Nt\geq n\geq…
In this paper we study the distribution tails and the moments of a condition number which arises in the study of homogeneous systems of linear inequalities. We consider the case where this system is defined by a Gaussian random matrix and…
We consider the tail probabilities of stock returns for a general class of stochastic volatility models. In these models, the stochastic differential equation for volatility is autonomous, time-homogeneous and dependent on only a finite…
The notion of tail adversarial stability has been proven useful in obtaining limit theorems for tail dependent time series. Its implication and advantage over the classical strong mixing framework has been examined for max-linear processes,…
We analyze the behavior of closed product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and prove the conjecture that the…
Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…
This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set $\mathcal{I}$, and…
For ordinary matrix models, the eigenvalue probability density decays rapidly as one goes to infinity, in other words, has "short tails". This ensures that all the multiple trace correlators (multipoint moments) are convergent and…
Exponential backoff (EB) is a widely adopted collision resolution mechanism in many popular random-access networks including Ethernet and wireless LAN (WLAN). The prominence of EB is primarily attributed to its asymptotic throughput…