Related papers: Functional limit theorems for Gaussian-fed queuein…
The expected supremum of a Gaussian process indexed by the image of an index set under a function class is bounded in terms of separate properties of the index set and the function class. The bound is relevant to the estimation of nonlinear…
Gaussian process is a theoretically appealing model for nonparametric analysis, but its computational cumbersomeness hinders its use in large scale and the existing reduced-rank solutions are usually heuristic. In this work, we propose a…
This paper studies a stochastic model that describes the evolution of vehicle densities in a road network. It is consistent with the class of (deterministic) kinematic wave models, which describe traffic flows on the basis of conservation…
This paper provides central limit theorems for the wavelet packet decomposition of stationary band-limited random processes. The asymptotic analysis is performed for the sequences of the wavelet packet coefficients returned at the nodes of…
We prove a limit theorem on the convergence of the distributions of the scaled last exit time over a slowly moving nonlinear boundary for a class of Gaussian stationary processes. The limit is a double exponential (Gumbel) distribution.
We consider a model for transitory queues in which only a finite number of customers can join. The queue thus operates over a finite time horizon. In this system, also known as the $\Delta_{(i)}/G/1$ queue, the customers decide…
We propose stochastic, non-parametric activation functions that are fully learnable and individual to each neuron. Complexity and the risk of overfitting are controlled by placing a Gaussian process prior over these functions. The result is…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
We develop a heavy traffic diffusion limit theorem under nonstandard spatial scaling for the queue length process in a single server queue employing shortest remaining processing time (SRPT). For processing time distributions with unbounded…
We say that a random variable is $light$-$tailed$ if moments of order $2+\epsilon$ are finite for some $\epsilon>0$; otherwise, we say that it is $heavy$-$tailed$. We study queueing networks that operate under the Max-Weight scheduling…
We develop link rate control policies to minimize the queueing delay of packets in overloaded networks. We show that increasing link rates does not guarantee delay reduction during overload. We consider a fluid queueing model that…
In large-scale distributed systems, balancing the load in an efficient way is crucial in order to achieve low latency. Recently, some load balancing policies have been suggested which are able to achieve a bounded maximum queue length in…
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,…
Atar and Miyazawa recently introduced a single server queue with queue length dependent arrival and service processes, and name it a multi-level queue. They prove that the heavy traffic limit of its queue length process weakly converges to…
We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…
Fundamental to many transportation network studies, traffic flow models can be used to describe traffic dynamics determined by drivers' car-following, lane-changing, merging, and diverging behaviors. In this study, we develop a…
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or points) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.)…
We study the $G/\mathit{GI}/\infty$ queue in heavy-traffic using tempered distribution-valued processes which track the age and residual service time of each customer in the system. In both cases, we use the continuous mapping theorem…
In geographically-distributed systems, communication latencies are non-negligible. The perceived processing time of a request is thus composed of the time needed to route the request to the server and the true processing time. Once a…
We consider fully connected and feedforward deep neural networks with dependent and possibly heavy-tailed weights, as introduced in [26], to address limitations of the standard Gaussian prior. It has been proved in [26] that, as the number…