Related papers: Fractional Erlang Queues

Consider the following birth and death process with the following infinitesimal transition probabilities {\lambda}(k) ={\lambda}/(1+k) and {\mu}(k) = {\mu}k with {\lambda},{\mu}> 0. This process has known as a discouragement queue [5].…

We introduce and study some queueing models with random resetting, including Markovian and non--Markovian models. The Markovian models include M/M/$\infty$, M/M/r and M/M/1+M queues with random resetting, in which a continuous-time Markov…

We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…

The dynamics of pedestrian crowds has been studied intensively in recent years, both theoretically and empirically. However, in many situations pedestrian crowds are rather static, e.g. due to jamming near bottlenecks or queueing at ticket…

Normalizing flows are generative machine learning models which can efficiently approximate probability distributions, using only given samples of a distribution. This architecture is used to interpolate the chiral condensate obtained from…

This study proposes a generalised macroscopic traffic simulation using a Mt/D/1/K queue to model congestion, using the Enniskillen to Belfast route as a case study. Empirical traffic data from Google's Directions API is used to calibrate…

In the study of large scale stochastic networks with resource management, differential equations and mean-field limits are two key techniques. Recent research shows that the expected fraction vector (that is, the tailed probability vector)…

While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…

We construct fractionally integrated continuous-time GARCH models, which capture the observed long range dependence of squared volatility in high-frequency data. Since the usual Molchan-Golosov and Mandelbrot-van-Ness fractional kernels…

We define and study fractional versions of the well-known Gamma subordinator $\Gamma :=\{\Gamma (t),$ $t\geq 0\},$ which are obtained by time-changing $% \Gamma $ by means of an independent stable subordinator or its inverse. Their…

A Langevin equation with a special type of additive random source is considered. This random force presents a fractional order derivative of white noise, and leads to a power-law time behavior of the mean square displacement of a particle,…

We give a recursive construction of the stationary distribution of multi-type asymmetric simple exclusion processes on a finite ring or on the infinite line $Z$. The construction can be interpreted in terms of "multi-line diagrams" or…

This paper is devoted to the study of a fractional version of non-linear $\mathpzc{M}^\nu(t)$, $t>0$, linear $M^\nu (t)$, $t>0$ and sublinear $\mathfrak{M}^\nu (t)$, $t>0$ death processes. Fractionality is introduced by replacing the usual…

We study the MAP/M/s+G queuing model with MAP (Markovian Arrival Process) arrivals, exponentially distributed service times, infinite waiting room, and generally distributed patience times. Using sample-path arguments, we propose to obtain…

We introduce a class of partial differential equations on metric graphs associated with mixed evolution: on some edges we consider diffusion processes, on other ones transport phenomena. This yields a system of equations with possibly…

In this paper we consider a generalized classical mechanics with fractional derivatives. The generalization is based on the time-clock randomization of momenta and coordinates taken from the conventional phase space. The fractional…

We present a broad literature survey of parameter and state estimation for queueing systems. Our approach is based on various inference activities, queueing models, observations schemes, and statistical methods. We categorize these into…

We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have…

We give a generalization of the ergodic theorem for semi-Markov linear-type processes. This generalization is proved for the case when a common support of distributions defining this process is not arithmetic. Also we give an uniform…

We obtain an explicit representation for the Laplace transform of the waiting time for a wide class of distributions by solving the Wiener-Hopf factorization problem via the Hadamard product theorem. Under broad conditions it is shown that…