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.
Cloud-computing shares a common pool of resources across customers at a scale that is orders of magnitude larger than traditional multiuser systems. Constituent physical compute servers are allocated multiple ‘virtual machines' (VMs) to serve simultaneously. Each VM user should ideally be unaffected by others’ demand. Naturally, this environment produces new challenges for the service providers in meeting customer expectations while extracting an efficient utilization from server resources. We study a new cloud service metric that measures prolonged latency or delay suffered by customers. We model the workload process of a cloud server and analyze the process as the customer population grows. The capacity required to ensure that the average workload does not exceed a threshold over long segments is characterized. This can be used by cloud operators to provide service guarantees on avoiding long durations of latency. As part of the analysis, we provide a uniform large deviation principle for collections of random variables that is of independent interest.
Upper deviation results are obtained for the split time of a supercritical continuous-time Markov branching process. More precisely, we establish the existence of logarithmic limits for the likelihood that the split times of the process are greater than an identified value and determine an expression for the limiting quantity. We also give an estimation for the lower deviation probability of the split times, which shows that the scaling is completely different from the upper deviations.
We study the asymptotic behaviors of estimators of the parameters in an Ornstein–Uhlenbeck process with linear drift, such as the law of the iterated logarithm (LIL) and Berry–Esseen bounds. As an application of the Berry–Esseen bounds, the precise rates in the LIL for the estimators are obtained.
In this paper we extend the existing literature on the asymptotic behavior of the partial sums and the sample covariances of long-memory stochastic volatility models in the case of infinite variance. We also consider models with leverage, for which our results are entirely new in the infinite-variance case. Depending on the interplay between the tail behavior and the intensity of dependence, two types of convergence rates and limiting distributions can arise. In particular, we show that the asymptotic behavior of partial sums is the same for both long memory in stochastic volatility and models with leverage, whereas there is a crucial difference when sample covariances are considered.
Let {Xi} be a sequence of independent, identically distributed random variables with an intermediate regularly varying right tail F̄. Let (N, C1, C2,…) be a nonnegative random vector independent of the {Xi} with N∈ℕ∪ {∞}. We study the weighted random sum SN=∑{i=1}NCiXi, and its maximum, MN=sup{1≤kN+1∑i=1kCiXi. This type of sum appears in the analysis of stochastic recursions, including weighted branching processes and autoregressive processes. In particular, we derive conditions under which P(MN > x)∼ P(SN > x)∼ E[∑i=1NF̄(x/Ci)] as x→∞. When E[X1]>0 and the distribution of ZN=∑ i=1NCi is also intermediate regularly varying, we obtain the asymptotics P(MN > x)∼ P(SN > x)∼ E[∑i=1NF̄}(x/Ci)] +P(ZN > x/E[X1]). For completeness, when the distribution of ZN is intermediate regularly varying and heavier than F̄, we also obtain conditions under which the asymptotic relations P(MN > x) ∼ P(SN > x)∼ P(ZN > x / E[X1] hold.
In this paper we study the functional central limit theorem (CLT) for stationary Markov chains with a self-adjoint operator and general state space. We investigate the case when the variance of the partial sum is not asymptotically linear in n, and establish that conditional convergence in distribution of partial sums implies the functional CLT. The main tools are maximal inequalities that are further exploited to derive conditions for tightness and convergence to the Brownian motion.
Motivated by stability questions on piecewise-deterministic Markov models of bacterial chemotaxis, we study the long-time behavior of a variant of the classic telegraph process having a nonconstant jump rate that induces a drift towards the origin. We compute its invariant law and show exponential ergodicity, obtaining a quantitative control of the total variation distance to equilibrium at each instant of time. These results rely on an exact description of the excursions of the process away from the origin and on the explicit construction of an original coalescent coupling for both the velocity and position. Sharpness of the obtained convergence rate is discussed.
Using Stein's method, we derive explicit upper bounds on the total variation distance between a Poisson-binomial law (the distribution of a sum of independent but not necessarily identically distributed Bernoulli random variables) and a Pólya distribution with the same support, mean, and variance; a nonuniform bound on the pointwise distance between the probability mass functions is also given. A numerical comparison of alternative distributional approximations on a somewhat representative collection of case studies is also exhibited. The evidence proves that no single one is uniformly most accurate, though it suggests that the Pólya approximation might be preferred in several parameter domains encountered in practice.
The classical secretary problem for selecting the best item is studied when the actual values of the items are observed with noise. One of the main appeals of the secretary problem is that the optimal strategy is able to find the best observation with a nontrivial probability of about 0.37, even when the number of observations is arbitrarily large. The results are strikingly different when the qualities of the secretaries are observed with noise. If there is no noise then the only information that is needed is whether an observation is the best among those already observed. Since the observations are assumed to be independent and identically distributed, the solution to this problem is distribution free. In the case of noisy data, the results are no longer distribution free. Furthermore, we need to know the rank of the noisy observation among those already observed. Finally, the probability of finding the best secretary often goes to 0 as the number of observations, n, goes to ∞. The results heavily depend on the behavior of pn, the probability that the observation that is best among the noisy observations is also best among the noiseless observations. Results involving optimal strategies if all that is available is noisy data are described and examples are given to elucidate the results.
Suppose that both you and your friend toss an unfair coin n times, for which the probability of heads is equal to α. What is the probability that you obtain at least d more heads than your friend if you make r additional tosses? We obtain asymptotic and monotonicity/convexity properties for this competing probability as a function of n, and demonstrate surprising phase transition phenomenon as the parameters d, r, and α vary. Our main tools are integral representations based on Fourier analysis.
We study a class of tenable, irreducible, nondegenerate zero-balanced Pólya urn schemes. We give a full characterization of the class by sufficient and necessary conditions. Only forms with a certain cyclic structure in their replacement matrix are admissible. The scheme has a steady state into proportions governed by the principal (left) eigenvector of the average replacement matrix. We study the gradual change for any such urn containing n → ∞ balls from the initial condition to the steady state. We look at the status of an urn starting with an asymptotically positive proportion of each color after jn draws. We identify three phases of jn: the growing sublinear, the linear, and the superlinear. In the growing sublinear phase the number of balls of different colors has an asymptotic joint multivariate normal distribution, with mean and covariance structure that are influenced by the initial conditions. In the linear phase a different multivariate normal distribution kicks in, in which the influence of the initial conditions is attenuated. The steady state is not a good approximation until a certain superlinear amount of time has elapsed. We give interpretations for how the results in different phases conjoin at the ‘seam lines’. In fact, these Gaussian phases are all manifestations of one master theorem. The results are obtained via multivariate martingale theory. We conclude with some illustrating examples.
A classical result about Markov jump processes states that a certain class of dynamical systems given by ordinary differential equations are obtained as the limit of a sequence of scaled Markov jump processes. This approach fails if the scaling cannot be carried out equally across all entities. In the present paper we present a convergence theorem for such an unequal scaling. In contrast to an equal scaling the limit process is not purely deterministic but still possesses randomness. We show that these processes constitute a rich subclass of piecewise-deterministic processes. Such processes apply in molecular biology where entities often occur in different scales of numbers.
In this paper we show that fractional Brownian motion with H < ½ can arise as a limit of a simple class of traffic processes that we call ‘scheduled traffic models’. To our knowledge, this paper provides the first simple traffic model leading to fractional Brownnian motion with H < ½. We also discuss some immediate implications of this result for queues fed by scheduled traffic, including a heavy-traffic limit theorem.
In a Galton-Watson branching process that is not extinct by the nth generation and has at least two individuals, pick two individuals at random by simple random sampling without replacement. Trace their lines of descent back in time till they meet. Call that generation Xn a pairwise coalescence time. Similarly, let Yn
denote the coalescence time for the whole population of the nth generation conditioned on the event that it is not extinct. In this paper the distributions of Xn and Yn, and their limit behaviors as n → ∞ are discussed for both the critical and subcritical cases.
A discrete-time SIS model is presented that allows individuals in the population to vary in terms of their susceptibility to infection and their rate of recovery. This model is a generalisation of the metapopulation model presented in McVinish and Pollett (2010). The main result of the paper is a central limit theorem showing that fluctuations in the proportion of infected individuals around the limiting proportion converges to a Gaussian random variable when appropriately rescaled. In contrast to the case where there is no variation amongst individuals, the limiting Gaussian distribution has a nonzero mean.
We extend Goldie's (1991) implicit renewal theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power-tail asymptotics of the distributions of the solutions R to and similar recursions, where (Q, N, C1, C2,…) is a nonnegative random vector with N ∈ {0, 1, 2, 3,…} ∪ {∞}, and are independent and identically distributed copies of R, independent of (Q, N, C1, C2,…); here ‘∨’ denotes the maximum operator.
A stochastic ordering approach is applied with Stein's method for approximation by the equilibrium distribution of a birth-death process. The usual stochastic order and the more general s-convex orders are discussed. Attention is focused on Poisson and translated Poisson approximations of a sum of dependent Bernoulli random variables, for example, k-runs in independent and identically distributed Bernoulli trials. Other applications include approximation by polynomial birth-death distributions.
The ‘coupon collection problem’ refers to a class of occupancy problems in which j identical items are distributed, independently and at random, to n cells, with no restrictions on multiple occupancy. Identifying the cells as coupons, a coupon is ‘collected’ if the cell is occupied by one or more of the distributed items; thus, some coupons may never be collected, whereas others may be collected once or twice or more. We call the number of coupons collected exactly r times coupons of type r. The coupon collection model we consider is general, in that a random number of purchases occurs at each stage of collecting a large number of coupons; the sample sizes at each stage are independent and identically distributed according to a sampling distribution. The joint behavior of the various types is an intricate problem. In fact, there is a variety of joint central limit theorems (and other limit laws) that arise according to the interrelation between the mean, variance, and range of the sampling distribution, and of course the phase (how far we are in the collection processes). According to an appropriate combination of the mean of the sampling distribution and the number of available coupons, the phase is sublinear, linear, or superlinear. In the sublinear phase, the normalization that produces a Gaussian limit law for uncollected coupons can be used to obtain a multivariate central limit law for at most two other types — depending on the rates of growth of the mean and variance of the sampling distribution, we may have a joint central limit theorem between types 0 and 1, or between types 0, 1, and 2. In the linear phase we have a multivariate central limit theorem among the types 0, 1,…, k for any fixed k.
Motivated by the study of the asymptotic normality of the least-squares estimator in the (autoregressive) AR(1) model under possibly infinite variance, in this paper we investigate a self-normalized central limit theorem for Markov random walks. That is, let {Xn, n ≥ 0} be a Markov chain on a general state space X with transition probability P and invariant measure π. Suppose that an additive component Sn takes values on the real line , and is adjoined to the chain such that {Sn, n ≥ 1} is a Markov random walk. Assume that Sn = ∑k=1nξk, and that {ξn, n ≥ 1} is a nondegenerate and stationary sequence under π that belongs to the domain of attraction of the normal law with zero mean and possibly infinite variance. By making use of an asymptotic variance formula of Sn / √n, we prove a self-normalized central limit theorem for Sn under some regularity conditions. An essential idea in our proof is to bound the covariance of the Markov random walk via a sequence of weight functions, which plays a crucial role in determining the moment condition and dependence structure of the Markov random walk. As illustrations, we apply our results to the finite-state Markov chain, the AR(1) model, and the linear state space model.
In this paper we study the asymptotic properties of the canonical plugin estimates for law-invariant coherent risk measures. Under rather mild conditions not relying on the explicit representation of the risk measure under consideration, we first prove a central limit theorem for independent and identically distributed data, and then extend it to the case of weakly dependent data. Finally, a number of illustrating examples is presented.