We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We consider the stability of robust scheduling policies for multiclass queueing networks. These are open networks with arbitrary routeing matrix and several disjoint groups of queues in which at most one queue can be served at a time. The arrival and potential service processes and routeing decisions at the queues are independent, stationary, and ergodic. A scheduling policy is called robust if it does not depend on the arrival and service rates nor on the routeing probabilities. A policy is called throughput-optimal if it makes the system stable whenever the parameters are such that the system can be stable. We propose two robust policies: longest-queue scheduling and a new policy called longest-dominating-queue scheduling. We show that longest-queue scheduling is throughput-optimal for two groups of two queues. We also prove the throughput-optimality of longest-dominating-queue scheduling when the network topology is acyclic, for an arbitrary number of groups and queues.
We consider three different schemes for signal routeing on a tree. The vertices of the tree represent transceivers that can transmit and receive signals, and are equipped with independent and identically distributed weights representing the strength of the transceivers. The edges of the tree are also equipped with independent and identically distributed weights, representing the costs for passing the edges. For each one of our schemes, we derive sharp conditions on the distributions of the vertex weights and the edge weights that determine when the root can transmit a signal over arbitrarily large distances.
In this paper the optimal dividend (subject to transaction costs) and reinsurance (with two reinsurers) problem is studied in the limit diffusion setting. It is assumed that transaction costs and taxes are required when dividends occur, and that the premiums charged by two reinsurers are calculated according to the exponential premium principle with different parameters, which makes the stochastic control problem nonlinear. The objective of the insurer is to determine the optimal reinsurance and dividend policy so as to maximize the expected discounted dividends until ruin. The problem is formulated as a mixed classical-impulse stochastic control problem. Explicit expressions for the value function and the corresponding optimal strategy are obtained. Finally, a numerical example is presented to illustrate the impact of the parameters associated with the two reinsurers' premium principle on the optimal reinsurance strategy.
It is known that in a stationary Brownian queue with both arrival and service processes equal in law to Brownian motion, the departure process is a Brownian motion, identical in law to the arrival process: this is the analogue of Burke's theorem in this context. In this paper we prove convergence in law to this Brownian motion in a tandem network of Brownian queues: if we have an arbitrary continuous process, satisfying some mild conditions, as an initial arrival process and pass it through an infinite tandem network of queues, the resulting process weakly converges to a Brownian motion. We assume independent and exponential initial workloads for all queues.
In this paper we define and study a new class of multivariate counting processes, named `multivariate generalized Pólya process'. Initially, we define and study the bivariate generalized Pólya process and briefly discuss its reliability application. In order to derive the main properties of the process, we suggest some key properties and an important characterization of the process. Due to these properties and the characterization, the main properties of the bivariate generalized Pólya process are obtained efficiently. The marginal processes of the multivariate generalized Pólya process are shown to be the univariate generalized Pólya processes studied in Cha (2014). Given the history of a marginal process, the conditional property of the other process is also discussed. The bivariate generalized Pólya process is extended to the multivariate case. We define a new dependence concept for multivariate point processes and, based on it, we analyze the dependence structure of the multivariate generalized Pólya process.
We consider connectivity properties and asymptotic slopes for certain random directed graphs on ℤ2 in which the set of points $\mathcal{C}_o$ that the origin connects to is always infinite. We obtain conditions under which the complement of $\mathcal{C}_o$ has no infinite connected component. Applying these results to one of the most interesting such models leads to an improved lower bound for the critical occupation probability for oriented site percolation on the triangular lattice in two dimensions.
An optimal selection problem for bid and ask quotes subject to a stock inventory constraint is investigated, formulated as a constrained utility maximisation problem over a finite time horizon. The arrivals of buy and sell orders are governed by Poisson processes, and a diffusion approximation is employed on assuming the Poisson arrivals intensity is sufficiently large. Using the dynamic programming principle, we adopt an efficient numerical procedure to solve this constrained utility maximisation problem based on a successive approximation algorithm, and conduct numerical experiments to analyse the impacts of the inventory constraint on a dealer's terminal profit and stock inventory level. It is found that the stock inventory constraint significantly affects the terminal stock inventory level.
We propose a class of random scale-free spatial networks with nested community structures called SHEM and analyze Reed–Frost epidemics with community related independent transmissions. We show that in a specific example of the SHEM the epidemic threshold may be trivial or not as a function of the relation among community sizes, distribution of the number of communities, and transmission rates.
In this paper we consider an Ornstein–Uhlenbeck (OU) process (M(t))t≥0 whose parameters are determined by an external Markov process (X(t))t≥0 on a finite state space {1, . . ., d}; this process is usually referred to as Markov-modulated Ornstein–Uhlenbeck. We use stochastic integration theory to determine explicit expressions for the mean and variance of M(t). Then we establish a system of partial differential equations (PDEs) for the Laplace transform of M(t) and the state X(t) of the background process, jointly for time epochs t = t1, . . ., tK. Then we use this PDE to set up a recursion that yields all moments of M(t) and its stationary counterpart; we also find an expression for the covariance between M(t) and M(t + u). We then establish a functional central limit theorem for M(t) for the situation that certain parameters of the underlying OU processes are scaled, in combination with the modulating Markov process being accelerated; interestingly, specific scalings lead to drastically different limiting processes. We conclude the paper by considering the situation of a single Markov process modulating multiple OU processes.
We consider Markov processes, which describe, e.g. queueing network processes, in a random environment which influences the network by determining random breakdown of nodes, and the necessity of repair thereafter. Starting from an explicit steady-state distribution of product form available in the literature, we note that this steady-state distribution does not provide information about the correlation structure in time and space (over nodes). We study this correlation structure via one-step correlations for the queueing-environment process. Although formulas for absolute values of these correlations are complicated, the differences of correlations of related networks are simple and have a nice structure. We therefore compare two networks in a random environment having the same invariant distribution, and focus on the time behaviour of the processes when in such a network the environment changes or the rules for travelling are perturbed. Evaluating the comparison formulas we compare spectral gaps and asymptotic variances of related processes.
Queues with advanced reservations are endemic in the real world. In such a queue, the 'arrival' process is an incoming stream of customer 'booking requests', rather than actual customers requiring immediate service. We consider a model with a Poisson booking request process with rate λ. Associated with each request is a pair of independent random variables (Ri, Si) constituting a request for service over a period Si, starting at a time Ri into the future. Our interest is in the probability that a customer will be rejected due to capacity constraints. We present a simulation of a finite-capacity queue in which we record the proportion of rejected customers, and then move to an analysis of a queue with infinitely-many servers. Obviously no customers are rejected in the latter case. However, the event that the arrival of the extra customer will cause the number of customers in the queue to exceed C at some point during its service can be used as a proxy for the event that the customer would have been rejected in a system with finite capacity C. We start by calculating the transient and stationary distributions for some performance measures for the infinite-server queue. By observing that the stationary measure for the bookings diary (that is, the list of customers currently on hand, together with their start times and service times) is the same as the law for the entire sample path of an infinite server queue with a specified nonhomogenous Poisson input process, which we call the bookings queue, we are able to write down expressions for the abovementioned probability that, at some time during a requested service, the number of customers exceeds C. This measure serves as a bound for the probability that an incoming arrival would be refused admission in a system with C servers and, for a well-dimensioned system, it is to be hoped that it is a good approximation. We test the quality of this approximation by comparing our analytical results for the infinite-server case against simulation results for the finite-server case.
In this paper we investigate different methods that may be used to compare coherent systems having heterogeneous components. We consider both the case of systems with independent components and the case of systems with dependent components. In the first case, the comparisons are based on the new concept of the survival signature due to Coolen and Coolen-Maturi (2012) which extends the well-known concept of system signatures to the case of components with lifetimes that need not be independent and identically distributed. In the second case, the comparisons are based on the concept of distortion functions. A graphical procedure (called an RR-plot) is proposed as an alternative to the analytical methods when there are two types of components.
We provide exact computations for the drift of random walks in dependent random environments, including k-dependent and moving average environments. We show how the drift can be characterized and evaluated using Perron–Frobenius theory. Comparing random walks in various dependent environments, we demonstrate that their drifts can exhibit interesting behavior that depends significantly on the dependency structure of the random environment.
The effect of disorder for pinning models is a subject which has attracted much attention in theoretical physics and rigorous mathematical physics. A peculiar point of interest is the question of coincidence of the quenched and annealed critical point for a small amount of disorder. The question has been mathematically settled in most cases in the last few years, giving in particular a rigorous validation of the Harris criterion on disorder relevance. However, the marginal case, where the return probability exponent is equal to $1/2$, that is, where the interarrival law of the renewal process is given by $\text{K}(n)=n^{-3/2}\unicode[STIX]{x1D719}(n)$ where $\unicode[STIX]{x1D719}$ is a slowly varying function, has been left partially open. In this paper, we give a complete answer to the question by proving a simple necessary and sufficient criterion on the return probability for disorder relevance, which confirms earlier predictions from the literature. Moreover, we also provide sharp asymptotics on the critical point shift: in the case of the pinning of a one-dimensional simple random walk, the shift of the critical point satisfies the following high temperature asymptotics
We have found a mistake in the proofs of Navarro (2008, Theorem 2.3(b) and 2.3(c)) due to misapplication of properties of hazard rate and likelihood ratio orders. In this paper we show with an example that the stated results do not hold. This example is interesting since it proves some unexpected properties for these orderings under the formation of coherent systems. The result stated in Navarro (2008, Theorem 2.3(a)) for the usual stochastic order is correct.
The Ginibre point process (GPP) is one of the main examples of determinantal point processes on the complex plane. It is a recurring distribution of random matrix theory as well as a useful model in applied mathematics. In this paper we briefly overview the usual methods for the simulation of the GPP. Then we introduce a modified version of the GPP which constitutes a determinantal point process more suited for certain applications, and we detail its simulation. This modified GPP has the property of having a fixed number of points and having its support on a compact subset of the plane. See Decreusefond et al. (2013) for an extended version of this paper.
Shot-noise processes are used in applied probability to model a variety of physical systems in, for example, teletraffic theory, insurance and risk theory, and in the engineering sciences. In this paper we prove a large deviation principle for the sample-paths of a general class of multidimensional state-dependent Poisson shot-noise processes. The result covers previously known large deviation results for one-dimensional state-independent shot-noise processes with light tails. We use the weak convergence approach to large deviations, which reduces the proof to establishing the appropriate convergence of certain controlled versions of the original processes together with relevant results on existence and uniqueness.
In this paper we consider an M/M/c queue modified to allow both mass arrivals when the system is empty and the workload to be removed. Properties of queues which terminate when the server becomes idle are firstly developed. Recurrence properties, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no mass exodus. All of these results are then generalized to allow for the removal of the entire workload. In particular, we obtain the Laplace transformation of the transition probability for the absorptive M/M/c queue.
In this paper we analyze a tollbooth tandem queueing problem with an infinite number of servers. A customer starts service immediately upon arrival but cannot leave the system before all customers who arrived before him/her have left, i.e. customers depart the system in the same order as they arrive. Distributions of the total number of customers in the system, the number of departure-delayed customers in the system, and the number of customers in service at time t are obtained in closed form. Distributions of the sojourn times and departure delays of customers are also obtained explicitly. Both transient and steady state solutions are derived first for Poisson arrivals, and then extended to cases with batch Poisson and nonstationary Poisson arrival processes. Finally, we report several stochastic ordering results on how system performance measures are affected by arrival and service processes.
In this paper we describe a perfect simulation algorithm for the stable M/G/c queue. Sigman (2011) showed how to build a dominated coupling-from-the-past algorithm for perfect simulation of the super-stable M/G/c queue operating under first-come-first-served discipline. Sigman's method used a dominating process provided by the corresponding M/G/1 queue (using Wolff's sample path monotonicity, which applies when service durations are coupled in order of initiation of service). The method exploited the fact that the workload process for the M/G/1 queue remains the same under different queueing disciplines, in particular under the processor sharing discipline, for which a dynamic reversibility property holds. We generalise Sigman's construction to the stable case by comparing the M/G/c queue to a copy run under random assignment. This allows us to produce a naïve perfect simulation algorithm based on running the dominating process back to the time it first empties. We also construct a more efficient algorithm that uses sandwiching by lower and upper processes constructed as coupled M/G/c queues started respectively from the empty state and the state of the M/G/c queue under random assignment. A careful analysis shows that appropriate ordering relationships can still be maintained, so long as service durations continue to be coupled in order of initiation of service. We summarise statistical checks of simulation output, and demonstrate that the mean run-time is finite so long as the second moment of the service duration distribution is finite.