Related papers: Tempered Erlang Queue with Multiple Arrivals
The usual development of the continuous-time random walk (CTRW) proceeds by assuming that the present is one of the jumping times. Under this restrictive assumption integral equations for the propagator and mean escape times have been…
We introduce a novel single-server queue with general retrial times and event-dependent arrivals. This is a versatile model for the study of service systems, in which the server needs a non-negligible time to retrieve waiting customers upon…
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.…
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 propose a general approach for approximate simulation and analysis of delay differential equations (DDEs) with distributed time delays based on methods for ordinary differential equations (ODEs). The key innovation is that…
The interplay between interactions and quenched disorder can result in rich dynamical quantum phenomena far from equilibrium, particularly when many-body localization prevents the system from full thermalization. With the aim of tackling…
A potential problem with adiabatic switching in perturbation theory is that divergent terms appear in the series solution. An example of this was presented by C. Brouder et al [4] for a simple 2 state system where the evolution of system in…
The distribution of waiting times between successive tunneling events is an already established method to characterize current fluctuations in mesoscopic systems. Here, I investigate mechanisms generating correlations between subsequent…
In the continuous time random walk model, the time-fractional operator usually expresses an infinite waiting time probability density. Different from that usual setting, this work considers the tempered time-fractional operator, which…
We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive…
Real-world processes often exhibit temporal separation between actions and reactions - a characteristic frequently ignored in many modelling frameworks. Adding temporal aspects, like time delays, introduces a higher complexity of problems…
We show how averages of exponential functions of path dependent quantities, such as those of Work Fluctuation Theorems, detect phase transitions in deterministic and stochastic systems. State space truncation -- the restriction of the…
This work defines two classes of processes, that we term {\it tempered fractional multistable motion} and {\it tempered multifractional stable motion}. They are extensions of fractional multistable motion and multifractional stable motion,…
Overlap times have been studied as a way of understanding the time of interaction between customers in a service facility. Most of the previous analysis relies on the single jump assumption for arrivals, which implies the queue increases by…
We introduce a formalism for the calculation of the time of arrival t at a space point for particles traveling through interacting media. We develop a general formulation that employs quantum canonical transformations from the free to the…
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue…
We analyse the problem of meeting times for interdependent stochastic agents: random walkers whose behaviour is stochastic but controlled by their selections from some set of allowed actions, and the inference problem of when these agents…
Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. The service operator dynamically chooses the arrival rate as…
This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…
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…