We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions of a Markovian bulk-arriving queue that stops immediately after hitting the zero state. Investigating such behavior is crucial in realizing the busy period and some other related properties of Markovian bulk-arriving queues. The exact value of the decay parameter λC is obtained and expressed explicitly. The invariant measures, invariant vectors, and quasistationary distributions are then presented. We show that there exists a family of invariant measures indexed by λ ∈ [0, λC]. We then show that, under some conditions, there exists a family of quasistationary distributions, also indexed by λ ∈ [0, λC]. The generating functions of these invariant measures and quasistationary distributions are presented. We further show that a stopped Markovian bulk-arriving queue is always λC-transient and some deep properties are revealed. The clear geometric interpretation of the decay parameter is explained. A few examples are then provided to illustrate the results obtained in this paper.

The largest components of the critical Erdős–Rényi graph, G(n, p) with p = 1 / n, have size of order n2/3 with high probability. We give detailed asymptotics for the probability that there is an unusually large component, i.e. of size an2/3 for large a. Our results, which extend the work of Pittel (2001), allow a to depend upon n and also hold for a range of values of p around 1 / n. We also provide asymptotics for the distribution of the size of the component containing a particular vertex.

In this paper, we consider an extended class of univariate and multivariate generalized Pólya processes and study its properties. In the generalized Pólya process considered in [8], each occurrence of an event increases the stochastic intensity of the counting process. In the extended class studied in this paper, on the contrary, it decreases the stochastic intensity of the process, which induces a kind of negative dependence in the increments in the disjoint time intervals. First, we define the extended class of generalized Pólya processes and derive some preliminary results which will be used in the remaining part of the paper. It is seen that the extended class of generalized Pólya processes can be viewed as generalized pure death processes, where the death rate depends on both the state and the time. Based on the preliminary results, the main properties of the multivariate extended generalized Pólya process and meaningful characterizations are obtained. Finally, possible applications to reliability modeling are briefly discussed.

In many-server systems it is crucial to staff the right number of servers so that targeted service levels are met. These staffing problems typically lead to constraint satisfaction problems that are difficult to solve. During the last decade, a powerful many-server asymptotic theory has been developed to solve such problems and optimal staffing rules are known to obey the square-root staffing principle. In this paper we develop many-server asymptotics in the so-called quality and efficiency driven regime, and present refinements to many-server asymptotics and square-root staffing for a Markovian queueing model with admission control and retrials.

Just after the fixation of an advantageous allele in the population (this spread is called a selective sweep), the neutral genes close to the site under selection tend to have the same ancestor as the gene under selection. However, some recombinations may occur during the selective sweep and break the link, which reduces the number of hitchhiking alleles. We consider a large selection coefficient α and extend the results of Etheridge, Pfaffelhuber and Wakolbinger (2006) and the work of Pfaffelhuber and Studeny (2007) about genetic hitchhiking, where the recombination rate scales with α/log α. We first describe the genealogy at an arbitrary number of partially linked neutral loci, with an order of accuracy of in total variation. Then, we use this framework to obtain an approximate distribution for the size of the hitchhiking set at the end of the selective sweep, with the same accuracy.

This paper studies a composite problem involving decision-making about the optimal entry time and dynamic consumption afterwards. In Stage 1, the investor has access to full market information subject to some information costs and needs to choose an optimal stopping time to initiate Stage 2; in Stage 2, the investor terminates the costly full information acquisition and starts dynamic investment and consumption under partial observation of free public stock prices. Habit formation preferences are employed, in which past consumption affects the investor’s current decisions. Using the stochastic Perron method, the value function of the composite problem is proved to be the unique viscosity solution of some variational inequalities.

Russell (1983) considers the distribution properties of N(a), the minimum value of n for which the sum Sn of n random variables, which are i.i.d. uniformly on (0, 1), exceeds the constant a, .

We study the asymptotic distribution of the total claim amount for marked Poisson cluster models. The marks determine the size and other characteristics of the individual claims and potentially influence the arrival rate of future claims. We find sufficient conditions under which the total claim amount satisfies the central limit theorem or, alternatively, tends in distribution to an infinite-variance stable random variable. We discuss several Poisson cluster models in detail, paying special attention to the marked Hawkes process as our key example.

This paper revisits a general optimal stopping problem that often appears as a special case in some finance applications. The problem is essentially of the same form as the investment-timing problem of McDonald and Siegel (1986) in which the underlying processes are two correlated geometric Brownian motions (GBMs) with drifts less than the discount rate. By contrast, we attempt to analyze the underlying optimal stopping problem to its full generality without imposing any restriction on the drifts of the GBMs. By extending the first passage time approach of Xia and Zhou (2007) to the current context, we manage to obtain a complete and explicit characterization of the solution to the problem on all possible drift domains. Our analysis leads to a new and interesting observation that the underlying optimal stopping problem admits a two-sided optimal continuation region on some certain parameter domains.

Large deviation estimates are derived for sums of random variables with certain dependence structures, including finite population statistics and random graphs. The argument is based on Stein's method, but with a novel modification of Stein's equation inspired by the Cramér transform.

Motivated by applications of Gabriel graphs and Yao graphs in wireless ad-hoc networks, we show that the maximum degree of a random Gabriel graph or Yao graph defined on n points drawn uniformly at random from a unit square grows as Θ (log n / log log n) in probability.

A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a 'preferential attachment' rule: the current vertex selects an image i with probability proportional to a given parameter α = α(n) plus the number of times i has already been selected. Intuitively, the larger α becomes, the closer the resulting k-out mapping is to the uniformly random k-out mapping. We prove that α = Θ(n1/2) is the threshold for α growing 'fast enough' to make the random digraph approach the uniformly random digraph in terms of the total variation distance. We also determine an exact limit for this distance for the α = βn1/2 case.

The polydisperse coagulation equation models irreversible aggregation of particles with varying masses. This paper uses a one-parameter family of discrete-time continuous multitype branching processes to solve the polydisperse coagulation equation when

The critical time tc when diverges corresponds to a critical branching process, while post-critical times t> tc correspond to supercritical branching processes.

The theory of allocation indices for defining the optimal policy in multi-armed bandit problems developed by Gittins is presented in the continuous-time case where the projects (or ‘arms’) are strong Markov processes. Complications peculiar to the continuous-time case are discussed. This motivates investigation of whether approximation of the continuous-time problems by discrete-time versions provides a valid technique with convergent allocation indices and optimal expected rewards. Conditions are presented under which the convergence holds.

Consider a real-valued discrete-time stationary and ergodic stochastic process, called the noise process. For each dimension n, we can choose a stationary point process in ℝn and a translation invariant tessellation of ℝn. Each point is randomly displaced, with a displacement vector being a section of length n of the noise process, independent from point to point. The aim is to find a point process and a tessellation that minimizes the probability of decoding error, defined as the probability that the displaced version of the typical point does not belong to the cell of this point. We consider the Shannon regime, in which the dimension n tends to ∞, while the logarithm of the intensity of the point processes, normalized by dimension, tends to a constant. We first show that this problem exhibits a sharp threshold: if the sum of the asymptotic normalized logarithmic intensity and of the differential entropy rate of the noise process is positive, then the probability of error tends to 1 with n for all point processes and all tessellations. If it is negative then there exist point processes and tessellations for which this probability tends to 0. The error exponent function, which denotes how quickly the probability of error goes to 0 in n, is then derived using large deviations theory. If the entropy spectrum of the noise satisfies a large deviations principle, then, below the threshold, the error probability goes exponentially fast to 0 with an exponent that is given in closed form in terms of the rate function of the noise entropy spectrum. This is obtained for two classes of point processes: the Poisson process and a Matérn hard-core point process. New lower bounds on error exponents are derived from this for Shannon's additive noise channel in the high signal-to-noise ratio limit that hold for all stationary and ergodic noises with the above properties and that match the best known bounds in the white Gaussian noise case.

We present an estimation procedure and analyse spectral properties of stochastic processes of the kind Zt = Xt + ξt = ϕ(Tt(ψ)) + ξt, for t ∊ Z, where T is a deterministic map, ϕ is a given function and ξt is a noise process. The examples considered in this paper generalize the classical harmonic model Zt = Acos(ω0t + ψ) + ξt, for t ∊ Z. Two examples are developed at length. In the first one, the spectral measure is discrete and in the second it is continuous. In the second example, the time series is obtained from a chaotic map. These two examples exhibit the extremal cases of different possibilities for the spectral measure of time series and they are both associated with ergodic deterministic transformations with noise. We present a method for obtaining explicitly the spectral density function (second example) and the autocorrelation coefficients (first example). In the first example the rotation number plays an important role. We also consider large deviation properties of the estimated parameters of the model.

A stationary process yt, t ∈ R1 is considered which is Markov between points of changeover from a stationary point process, and at these points it changes over according to a distribution dependent only on the value of yt just before the change is analysed. An explicit form of a rate-conservative principle is stated, and its relationship with formulae relating the distribution of the process at an instant t and the distribution at a point of changeover is shown. The theory is applied to discrete state processes and to processes which are generalizations of the Takács processes, and is also applied in the theory of G/M/l and G/G/k queues to obtain relations between distributions of a process and some process imbedded in it.

Equivalence of rates of convergence in the central limit theorem between the vector of maximum sums and the corresponding first-passage variables is established. The bivariate case is studied. Analogous results about the equivalence between the vector of partial sums and corresponding renewal variables are also given and as a consequence we obtain a generalization of a theorem of Hunter (1974). Extension of the main result to more general first-passage times is also developed.

An abstract gambler's problem is formulated in a continuous-time setting and analogues are proved for some of the discrete-time results of Dubins and Savage in their book How to Gamble if You Must. Applications are made to problems of controlling a Brownian motion process.