Related papers: A MGinf Queue Busy Period Distribution Characteriz…
The greedy spanner is the highest quality geometric spanner (in e.g. edge count and weight, both in theory and practice) known to be computable in polynomial time. Unfortunately, all known algorithms for computing it take Omega(n^2) time,…
We study the long-time behavior of underdamped Brownian particle moving through a viscous medium and in a systematic potential, when it is subjected to a space-dependent high-frequency periodic force. When the frequency is very large, much…
In a stochastic heat engine driven by a cyclic non-equilibrium protocol, fluctuations in work and heat give rise to a fluctuating efficiency. Using computer simulations and tools from large deviation theory, we have examined these…
Given a gamma population with known shape parameter $\alpha$, we develop a general theory for estimating a function $g(\cdot)$ of the scale parameter $\beta$ with bounded variance. We begin by defining a sequential sampling procedure with…
We study the approximability of instances of the minimum entropy set cover problem, parameterized by the average frequency of a random element in the covering sets. We analyze an algorithm combining a greedy approach with another one biased…
The beta Weibull distribution was introduced by Famoye et al. (2005) and studied by these authors. However, they do not give explicit expressions for the moments. We now derive explicit closed form expressions for the cumulative…
This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines. At each point in time, the collection of residual service times and deadlines is modeled using a random counting measure on the right half-plane. The…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node. Initially the members of an initial set $S\subseteq V$ are influenced. During…
We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a…
A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…
A mean-field extension of the queueing system \(GI/GI/1\) is considered. The process is constructed as a Markov solution of a martingale problem. Uniqueness in distribution is established under a bit different sets of assumptions on…
This article explores the required amount of time series points from a high-speed traffic network to accurately estimate the Hurst exponent. The methodology consists in designing an experiment using estimators that are applied to time…
Correlated proportions appear in many real-world applications and present a unique challenge in terms of finding an appropriate probabilistic model due to their constrained nature. The bivariate beta is a natural extension of the well-known…
We consider a dynamical process in a network which distributes all particles (tokens) located at a node among its neighbors, in a round-robin manner. We show that in the recurrent state of this dynamics (i.e., disregarding a polynomially…
By analyzing empirical time headway distributions of traffic flow, a hypothesis about the underlying stochastic process can be drawn. The results found lead to the assumption that the headways $T_i$ of individual vehicles follow a linear…
A new five-parameter continuous distribution which generalizes the Kumaraswamy and the beta distributions as well as some other well-known distributions is proposed and studied. The model has as special cases new four- and three-parameter…
Congestion in network occurs due to exceed in aggregate demand as compared to the accessible capacity of the resources. Network congestion will increase as network speed increases and new effective congestion control methods are needed,…
In this paper we propose a new lifetime model, called the odd generalized exponential linear failure rate distribution. Some statistical properties of the proposed distribution such as the moments, the quantiles, the median, and the mode…
We consider a general class of intermittent maps designed to be weakly chaotic, i.e., for which the separation of trajectories of nearby initial conditions is weaker than exponential. We show that all its spatio and temporal properties,…