Related papers: On Mixed Time-Changed Erlang Queue
Motivated by queueing applications, we study various reflected autoregressive processes with dependencies. Amongst others, we study cases where the interarrival and service times are proportionally dependent with additive and/or subtracting…
We consider a type of optimal switching problems with non-uniform execution delays and ramping. Such problems frequently occur in the operation of economical and engineering systems. We first provide a solution to the problem by applying a…
This paper considers appointment scheduling in a setting in which at every client arrival the schedule of all future clients can be adapted. Starting our analysis with an explicit treatment of the case of exponentially distributed service…
This paper considers a modified Erlang loss system for cognitive wireless networks and related applications. A primary user has preemptive priority over secondary users and the primary customer is lost if upon arrival all the channels are…
In this paper, we study a multivariate version of the generalized counting process (GCP) and discuss its various time-changed variants. The time is changed using random processes such as the stable subordinator, inverse stable subordinator,…
We study the behaviour of a Schelling-class system in which a fraction $f$ of spatially-fixed switching agents is introduced. This new model allows for multiple interpretations, including: (i) random, non-preferential allocation…
In this paper we extend the definition of time conditional G-expectations $\mathbb{\hat{E}}_{t}[\cdot]$ to a larger domain on which the dynamical consistency still holds. In fact we can consistently define, by taking the limit, the time…
In this paper we analyze a coupled system between a transport equation and an ordinary differential equation with time delay (which is a simplified version of a model for kidney blood flow control). Through a careful spectral analysis we…
Quantum and classical models for delayed choice entanglement swapping by postselection of measurements are discussed.
The dynamics of electronic tunneling through a disordered 1D chain of finite length is considered. We calculate distributions of the transmission coefficient T, Wigner delay time and, $\tau_\phi$ and the transport time, $\tau_t=T\tau_\phi$.…
We develop a flexible Erlang mixture model for survival analysis. The model for the survival density is built from a structured mixture of Erlang densities, mixing on the integer shape parameter with a common scale parameter. The mixture…
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…
The Makespan Scheduling problem is an extensively studied NP-hard problem, and its simplest version looks for an allocation approach for a set of jobs with deterministic processing times to two identical machines such that the makespan is…
This paper is concerned with a linear quadratic stochastic Stackelberg differential game with time delay. The model is general, in which the state delay and the control delay both appear in the state equation, moreover, they both enter into…
We introduce a non-Markovian generalization of the classical M/M/1 queue by incorporating extended nonlocal time dynamics into Kolmogorov forward equations. We obtain the model by replacing the standard time derivative with an extended…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
Using the diagonal entropy, we analyze the dynamical signatures of the Lipkin-Meshkov-Glick (LMG) model excited-state quantum phase transition (ESQPT). We first show that the time evolution of the diagonal entropy behaves as an efficient…
In this article it is shown that if the busy period of a MGinf queue system is PME distributed, the service time is a random variable with a long tail distribution. The result is obtained through Laplace transforms analysis.
Many models such as Long Short Term Memory (LSTMs), Gated Recurrent Units (GRUs) and transformers have been developed to classify time series data with the assumption that events in a sequence are ordered. On the other hand, fewer models…
The analysis of stochastic loss networks has long been of interest in computer and communications networks and is becoming important in the areas of service and information systems. In traditional settings, computing the well known Erlang…