Related papers: Batch queues, reversibility and first-passage perc…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
A simple but powerful network model with $n$ nodes and $m$ partly overlapping layers is generated as an overlay of independent random graphs $G_1,\dots,G_m$ with variable sizes and densities. The model is parameterised by a joint…
We consider the Busemann process in planar directed first passage percolation. We extend existing techniques to establish the existence of the process in our setting and determine its distribution in a number of integrable models. As…
New recursive estimators for computing higher-order derivatives of mean queueing time from a single sample path of a first-come, first-served single-server queue are presented, derived using the well-known Lindley equation and applying the…
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 the $M/M/1$-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn…
We consider the coupling of a single server queue and a storage model defined as a Queue/Store model in Draief et al. 2004. We establish that if the input variables, arrivals at the queue and store, satisfy large deviations principles and…
We explore first-passage phenomenology for biased active processes with a renewal-type structure, focusing in particular on paradigmatic run-and-tumble models in both discrete and continuous state spaces. In general, we show there is no…
We discuss the order of the variance on a lattice analogue of the Hammersley process with boundaries, for which the environment on each site has independent, Bernoulli distributed values. The last passage time is the maximum number of…
We consider open multi-class queueing networks with general arrival processes, general processing time sequences and Bernoulli routing. The network is assumed to be operating under an arbitrary work-conserving scheduling policy that makes…
Many random growth models have the property that the set of discovered sites, scaled properly, converges to some deterministic set as time grows. Such results are known as shape theorems. Typically, not much is known about the shapes. For…
In this paper, we display methods for the computation of convergence and perturbation bounds for $M_t/M_t/1$ system with balking, catastrophes, server failures and repairs. Based on the logarithmic norm of linear operators, the bounds on…
In the Hammersley-Aldous-Diaconis process infinitely many particles sit in R and at most one particle is allowed at each position. A particle at x$ whose nearest neighbor to the right is at y, jumps at rate y-x to a position uniformly…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
We present a class of positive discrete random variables extending the Conway--Maxwell-Poisson distribution. This class emerges in a natural way from an application in queueing theory and contains distributions exhibiting quite different…
We analyze a semi-infinite one-dimensional random walk process with a biased motion that is incremental in one direction and long-range in the other. On a network with a fixed hierarchy of long-range jumps, we find with exact…
The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total expected square loss is a particularly interesting…
Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and…
We introduce and study derivatives in first-passage percolation with edge weights given by i.i.d. random variables supported on ${a,b}$. We show that the variance of the passage time can be expressed in terms of these derivatives. We…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…