We examine necessary and sufficient conditions for recurrence and positive recurrence of a class of irreducible, level-dependent quasi-birth-and-death (LDQBD) processes with a block tridiagonal structure that exhibits asymptotic convergence in the rows as the level tends to infinity. These conditions are obtained by exploiting a multi-dimensional Lyapunov drift approach, along with the theory of generalized Markov group inverses. Additionally, we highlight analogies to well-known average drift results for level-independent quasi-birth-and-death (QBD) processes.

It is well known that traditional Markov chain Monte Carlo (MCMC) methods can fail to effectively explore the state space for multimodal problems. Parallel tempering is a well-established population approach for such target distributions involving a collection of particles indexed by temperature. However, this method can suffer dramatically from the curse of dimensionality. In this paper we introduce an improvement on parallel tempering called QuanTA. A comprehensive theoretical analysis quantifying the improved efficiency and scalability of the approach is given. Under weak regularity conditions, QuanTA gives accelerated mixing through the temperature space. Empirical evidence of the effectiveness of this new algorithm is illustrated on canonical examples.

The steepest increase property of phase-type (PH) distributions was first proposed in O’Cinneide (1999) and proved in O’Cinneide (1999) and Yao (2002), but since then has received little attention in the research community. In this work we demonstrate that the steepest increase property can be applied for proving previously unknown moment bounds of PH distributions with infinite or finite support. Of special interest are moment bounds free of specific PH representations except the size of the representation. For PH distributions with infinite support, it is shown that such a PH distribution is stochastically smaller than or equal to an Erlang distribution of the same size. For PH distributions with finite support, a class of distributions which was introduced and investigated in Ramaswami and Viswanath (2014), it is shown that the squared coefficient of variation of a PH distribution with finite support is greater than or equal to 1/(m(m + 2)), where m is the size of its PH representation.

The probability of successfully spending twice the same bitcoins is considered. A double-spending attack consists in issuing two transactions transferring the same bitcoins. The first transaction, from the fraudster to a merchant, is included in a block of the public chain. The second transaction, from the fraudster to himself, is recorded in a block that integrates a private chain, exact copy of the public chain up to substituting the fraudster-to-merchant transaction by the fraudster-to-fraudster transaction. The double-spending hack is completed once the private chain reaches the length of the public chain, in which case it replaces it. The growth of both chains are modelled by two independent counting processes. The probability distribution of the time at which the malicious chain catches up with the honest chain, or, equivalently, the time at which the two counting processes meet each other, is studied. The merchant is supposed to await the discovery of a given number of blocks after the one containing the transaction before delivering the goods. This grants a head start to the honest chain in the race against the dishonest chain.

We consider the so-called frog model with random initial configurations. The dynamics of this model are described as follows. Some particles are randomly assigned to any site of the multidimensional cubic lattice. Initially, only particles at the origin are active and these independently perform simple random walks. The other particles are sleeping and do not move at first. When sleeping particles are hit by an active particle, they become active and start moving in a similar fashion. The aim of this paper is to derive large deviation and concentration bounds for the first passage time at which an active particle reaches a target site.

Many wear processes used for modeling accumulative deterioration in a reliability context are nonhomogeneous Lévy processes and, hence, have independent increments, which may not be suitable in an application context. In this work we consider Lévy processes transformed by monotonous functions to overcome this restriction, and provide a new state-dependent wear model. These transformed Lévy processes are first observed to remain tractable Markov processes. Some distributional properties are derived. We investigate the impact of the current state on the future increment level and on the overall accumulated level from a stochastic monotonicity point of view. We also study positive dependence properties and stochastic monotonicity of increments.

For a multivariate random walk with independent and identically distributed jumps satisfying the Cramér moment condition and having mean vector with at least one negative component, we derive the exact asymptotics of the probability of ever hitting the positive orthant that is being translated to infinity along a fixed vector with positive components. This problem is motivated by and extends results of Avram et al. (2008) on a two-dimensional risk process. Our approach combines the large deviation techniques from a series of papers by Borovkov and Mogulskii from around 2000 with new auxiliary constructions, enabling us to extend their results on hitting remote sets with smooth boundaries to the case of boundaries with a ‘corner’ at the ‘most probable hitting point’. We also discuss how our results can be extended to the case of more general target sets.

We provide a sufficient condition for the uniqueness in distribution of Gibbs point processes with non-negative pairwise interaction, together with convergent expansions of the log-Laplace functional, factorial moment densities and factorial cumulant densities (correlation functions and truncated correlation functions). The criterion is a continuum version of a convergence condition by Fernández and Procacci (2007), the proof is based on the Kirkwood–Salsburg integral equations and is close in spirit to the approach by Bissacot, Fernández, and Procacci (2010). In addition, we provide formulas for cumulants of double stochastic integrals with respect to Poisson random measures (not compensated) in terms of multigraphs and pairs of partitions, explaining how to go from cluster expansions to some diagrammatic expansions (Peccati and Taqqu, 2011). We also discuss relations with generating functions for trees, branching processes, Boolean percolation and the random connection model. The presentation is self-contained and requires no preliminary knowledge of cluster expansions.

Using a result of Blanchet and Wallwater (2015) for exactly simulating the maximum of a negative drift random walk queue endowed with independent and identically distributed (i.i.d.) increments, we extend it to a multi-dimensional setting and then we give a new algorithm for simulating exactly the stationary distribution of a first-in–first-out (FIFO) multi-server queue in which the arrival process is a general renewal process and the service times are i.i.d.: the FIFO GI/GI/c queue with $ 2 \leq c \lt \infty$ . Our method utilizes dominated coupling from the past (DCFP) as well as the random assignment (RA) discipline, and complements the earlier work in which Poisson arrivals were assumed, such as the recent work of Connor and Kendall (2015). We also consider the models in continuous time, and show that with mild further assumptions, the exact simulation of those stationary distributions can also be achieved. We also give, using our FIFO algorithm, a new exact simulation algorithm for the stationary distribution of the infinite server case, the GI/GI/ $\infty$ model. Finally, we even show how to handle fork–join queues, in which each arriving customer brings c jobs, one for each server.

The ranking and selection problem is a well-known mathematical framework for the formal study of optimal information collection. Expected improvement (EI) is a leading algorithmic approach to this problem; the practical benefits of EI have repeatedly been demonstrated in the literature, especially in the widely studied setting of Gaussian sampling distributions. However, it was recently proved that some of the most well-known EI-type methods achieve suboptimal convergence rates. We investigate a recently proposed variant of EI (known as ‘complete EI’) and prove that, with some minor modifications, it can be made to converge to the rate-optimal static budget allocation without requiring any tuning.

In this paper we investigate the link between the joint law of a d-dimensional random vector and the law of some of its multivariate marginals. We introduce and focus on a class of distributions, that we call projective, for which we give detailed properties. This allows us to obtain necessary conditions for a given construction to be projective. We illustrate our results by proposing some theoretical projective distributions, as elliptical distributions or a new class of distribution having given bivariate margins. In the case where the data does not necessarily correspond to a projective distribution, we also explain how to build proper distributions while checking that the distance to the prescribed projections is small enough.

Motivated by Avram, Vu and Zhou (2017), Kyprianou and Zhou (2009), Li, Vu and Zhou (2017), Wang and Hu (2012), and Wang and Zhou (2018), we consider in this paper the problem of maximizing the expected accumulated discounted tax payments of an insurance company, whose reserve process (before taxes are deducted) evolves as a spectrally negative Lévy process with the usual exclusion of negative subordinator or deterministic drift. Tax payments are collected according to the very general loss-carry-forward tax system introduced in Kyprianou and Zhou (2009). To achieve a balance between taxation optimization and solvency, we consider an interesting modified objective function by considering the expected accumulated discounted tax payments of the company until the general draw-down time, instead of until the classical ruin time. The optimal tax return function and the optimal tax strategy are derived, and some numerical examples are also provided.

We consider subgraph counts in general preferential attachment models with power-law degree exponent $\tau > 2$. For all subgraphs H, we find the scaling of the expected number of subgraphs as a power of the number of vertices. We prove our results on the expected number of subgraphs by defining an optimization problem that finds the optimal subgraph structure in terms of the indices of the vertices that together span it and by using the representation of the preferential attachment model as a Pólya urn model.

We consider a class of sample covariance matrices of the form Q = TXX*T*, where X = (xij) is an M×N rectangular matrix consisting of independent and identically distributed entries, and T is a deterministic matrix such that T*T is diagonal. Assuming that M is comparable to N, we prove that the distribution of the components of the right singular vectors close to the edge singular values agrees with that of Gaussian ensembles provided the first two moments of xij coincide with the Gaussian random variables. For the right singular vectors associated with the bulk singular values, the same conclusion holds if the first four moments of xij match those of the Gaussian random variables. Similar results hold for the left singular vectors if we further assume that T is diagonal.

We consider a branching random walk on a multitype (with Q types of particles), supercritical Galton–Watson tree which satisfies the Kesten–Stigum condition. We assume that the displacements associated with the particles of type Q have regularly varying tails of index $\alpha$ , while the other types of particles have lighter tails than the particles of type Q. In this paper we derive the weak limit of the sequence of point processes associated with the positions of the particles in the nth generation. We verify that the limiting point process is a randomly scaled scale-decorated Poisson point process using the tools developed by Bhattacharya, Hazra, and Roy (2018). As a consequence, we obtain the asymptotic distribution of the position of the rightmost particle in the nth generation.

We consider a two-player zero-sum stochastic differential game with a random planning horizon and diffusive state variable dynamics. The random planning horizon is a function of a non-negative continuous random variable, which is assumed to be independent of the Brownian motion driving the state variable dynamics. We study this game using a combination of dynamic programming and viscosity solution techniques. Under some mild assumptions, we prove that the value of the game exists and is the unique viscosity solution of a certain nonlinear partial differential equation of Hamilton–Jacobi–Bellman–Isaacs type.

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.

The nonstationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large-scale multiserver service systems that may experience customer abandonments, such as call centers, hospitals, and urban mobility systems. In this paper we develop novel approximations to all of its transient and steady state moments, the moment generating function, and the cumulant generating function. We also provide precise bounds for the difference of our approximations and the true model. More importantly, we show that our approximations have explicit stochastic representations as shifted Poisson random variables. Moreover, we are also able to show that our approximations and bounds also hold for nonstationary Erlang-B and Erlang-C queueing models under certain stability conditions.