We construct a wavelet-based almost-sure uniform approximation of fractional Brownian motion (FBM) (B_t^(H))_{_t∈[0,1]} of Hurst index H ∈ (0, 1). Our results show that, by Haar wavelets which merely have one vanishing moment, an almost-sure uniform expansion of FBM for H ∈ (0, 1) can be established. The convergence rate of our approximation is derived. We also describe a parallel algorithm that generates sample paths of an FBM efficiently.

We consider two fractional versions of a family of nonnegative integer-valued processes. We prove that their probability mass functions solve fractional Kolmogorov forward equations, and we show the overdispersion of these processes. As particular examples in this family, we can define fractional versions of some processes in the literature as the Pólya-Aeppli process, the Poisson inverse Gaussian process, and the negative binomial process. We also define and study some more general fractional versions with two fractional parameters.

We study the relations between the tail order of copulas and hidden regular variation (HRV) on subcones generated by order statistics. Multivariate regular variation (MRV) and HRV deal with extremal dependence of random vectors with Pareto-like univariate margins. Alternatively, if one uses a copula to model the dependence structure of a random vector then the upper exponent and tail order functions can be used to capture the extremal dependence structure. After defining upper exponent functions on a series of subcones, we establish the relation between the tail order of a copula and the tail indexes for MRV and HRV. We show that upper exponent functions of a copula and intensity measures of MRV/HRV can be represented by each other, and the upper exponent function on subcones can be expressed by a Pickands-type integral representation. Finally, a mixture model is given with the mixing random vector leading to the finite-directional measure in a product-measure representation of HRV intensity measures.

Suppose that a system consists of n independent and identically distributed components and that the life lengths of the n components are X_i, i = 1, ..., n. For k ∈ {1, ..., n - 1}, let X^(k)₁, ..., X^(k)_n-k be the residual life lengths of the live components following the kth failure in the system. In this paper we extend various stochastic ordering results presented in Bairamov and Arnold (2008) on the residual life lengths of the live components in an (n - k + 1)-out-of-n system, and also present a new result concerning the multivariate stochastic ordering of live components in the two-sample situation. Finally, we also characterize exponential distributions under a weaker condition than those introduced in Bairamov and Arnold (2008) and show that some special ageing properties of the original residual life lengths get preserved by residual life lengths.

In the present paper, results given in Natvig (1990) are generalized to a multistate, strongly coherent, nonrepairable system of independent components by considering the reduction in remaining system time above a certain state due to a jump downwards of a component. This reduction also equals the increase in remaining system time above a certain state due to a minimal repair of the component at its time of jump downwards. The expected value of the sum of such reductions/increases for the different possible jumps downwards of the component is the building block of the Natvig measure of the importance of the component in the multistate case. Hence, the whole distributions of these reductions/increases are arrived at, not only the expectations, throwing more light on the consequences for the system of the deterioration of the components.

The idea of the system signature is extended here to the case of ordered system lifetimes arising from a test of coherent systems with a signature. An expression is given for the computation of the ordered system signatures in terms of the usual system signature for system lifetimes. Some properties of the ordered system signatures are then established. Closed-form expressions for the ordered system signatures are obtained in some special cases, and some illustrative examples are presented.

Computing the value of a high-dimensional integral can often be reduced to the problem of finding the ratio between the measures of two sets. Monte Carlo methods are often used to approximate this ratio, but often one set will be exponentially larger than the other, which leads to an exponentially large variance. A standard method of dealing with this problem is to interpolate between the sets with a sequence of nested sets where neighboring sets have relative measures bounded above by a constant. Choosing such a well-balanced sequence can rarely be done without extensive study of a problem. Here a new approach that automatically obtains such sets is presented. These well-balanced sets allow for faster approximation algorithms for integrals and sums using fewer samples, and better tempering and annealing Markov chains for generating random samples. Applications, such as finding the partition function of the Ising model and normalizing constants for posterior distributions in Bayesian methods, are discussed.

In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with some distribution F. We consider the simplest approximation algorithm, namely, the nearest-neighbor algorithm, where the rule is to move to the nearest nonvisited city. We show that the limiting behavior of the total length of the nearest-neighbor tour depends on the scaling properties of the density of F at 0 and derive the limits for all possible cases of general F.

We propose a discrete state-space model for storage of urban stormwater in two connected dams using an optimal pump-to-fill policy to transfer water from the capture dam to the holding dam. We assume stochastic supply to the capture dam and independent stochastic demand from the holding dam. We find new analytic formulae to calculate steady-state probabilities for the contents of each dam and thereby enable operators to better understand system behaviour. We illustrate our methods by considering some particular examples and discuss extension of our analysis to a series of three connected dams.

Let {Z_n}_n≥0 be a random walk with a negative drift and independent and identically distributed increments with heavy-tailed distribution, and let M = sup_n≥0Z_n be its supremum. Asmussen and Klüppelberg (1996) considered the behavior of the random walk given that M > x for large x, and obtained a limit theorem, as x → ∞, for the distribution of the quadruple that includes the time τ = τ(x) to exceed level x, position Z_τ at this time, position Z_τ-1 at the prior time, and the trajectory up to it (similar results were obtained for the Cramér-Lundberg insurance risk process). We obtain here several extensions of this result to various regenerative-type models and, in particular, to the case of a random walk with dependent increments. Particular attention is given to describing the limiting conditional behavior of τ. The class of models includes Markov-modulated models as particular cases. We also study fluid models, the Björk-Grandell risk process, give examples where the order of τ is genuinely different from the random walk case, and discuss which growth rates are possible. Our proofs are purely probabilistic and are based on results and ideas from Asmussen, Schmidli and Schmidt (1999), Foss and Zachary (2002), and Foss, Konstantopoulos and Zachary (2007).

In this short article we will provide a sufficient and necessary condition to have uniqueness of the location of the maximum of a stochastic process over an interval. The result will also express the mean value of the location in terms of the derivative of the expectation of the maximum of a linear perturbation of the underlying process. As an application, we will consider a Brownian motion with variable drift. The ideas behind the method of proof will also be useful to study the location of the maximum, over the real line, of a two-sided Brownian motion minus a parabola and of a stationary process minus a parabola.

We consider a one-dimensional discrete symmetric random walk with a reflecting boundary at the origin. Generating functions are found for the two-dimensional probability distribution P{S_n = x, max_1≤j≤nS_n = a} of being at position x after n steps, while the maximal location that the walker has achieved during these n steps is a. We also obtain the familiar (marginal) one-dimensional distribution for S_n = x, but more importantly that for max_1≤j≤nS_j = a asymptotically at fixed a² / n. We are able to compute and compare the expectations and variances of the two one-dimensional distributions, finding that they have qualitatively similar forms, but differ quantitatively in the anticipated fashion.

The recently introduced two-parameter infinitely-many-neutral-alleles model extends the celebrated one-parameter version (which is related to Kingman's distribution) to diffusive two-parameter Poisson-Dirichlet frequencies. In this paper we investigate the dynamics driving the species heterogeneity underlying the two-parameter model. First we show that a suitable normalization of the number of species is driven by a critical continuous-state branching process with immigration. Secondly, we provide a finite-dimensional construction of the two-parameter model, obtained by means of a sequence of Feller diffusions of Wright-Fisher flavor which feature finitely many types and inhomogeneous mutation rates. Both results provide insight into the mathematical properties and biological interpretation of the two-parameter model, showing that it is structurally different from the one-parameter case in that the frequency dynamics are driven by state-dependent rather than constant quantities.

Examining possibilities for the coexistence of two competing populations is a classic problem which dates back to the earliest `predator-prey' models. In this paper we study this problem in the context of a model introduced in Björnberg et al. (2012) for the spread of a virus infection in a population of healthy cells. The infected cells may be seen as a population of `predators' and the healthy cells as a population of `prey'. We show that, depending on the parameters defining the model, there may or may not be coexistence of the two populations, and we give precise criteria for this.

We investigate the distribution of the coalescence time (most recent common ancestor) for two individuals picked at random (uniformly) in the current generation of a continuous-time Bienaymé-Galton-Watson process founded t units of time ago. We also obtain limiting distributions as t → ∞ in the subcritical case. We extend our results for two individuals to the joint distribution of coalescence times for any finite number of individuals sampled in the current generation.

Although the exact expressions for the extinction probabilities of the Interacting Branching Collision Processes (IBCP) were very recently given by Chen et al. [4], some of these expressions are very complicated; hence, useful information regarding asymptotic behaviour, for example, is harder to obtain. Also, these exact expressions take very different forms for different cases and thus seem lacking in homogeneity. In this paper, we show that the asymptotic behaviour of these extremely complicated and tangled expressions for extinction probabilities of IBCP follows an elegant and homogenous power law which takes a very simple form. In fact, we are able to show that if the extinction is not certain then the extinction probabilities {a_n} follow an harmonious and simple asymptotic law of a_n ∼ kn^-αρ_cⁿ as n → ∞, where k and α are two constants, ρ_c is the unique positive zero of the C(s), and C(s) is the generating function of the infinitesimal collision rates. Moreover, the interesting and important quantity α takes a very simple and uniform form which could be interpreted as the `spectrum', ranging from -∞ to +∞, of the interaction between the two components of branching and collision of the IBCP.

Random arrangements of points in the plane, interacting only through a simple hard-core exclusion, are considered. An intensity parameter controls the average density of arrangements, in analogy with the Poisson point process. It is proved that, at high intensity, an infinite connected cluster of excluded volume appears almost surely.

A recent result of Ding, Lee and Peres (2012) expressed the cover time of the random walk on a graph in terms of generic chaining for the commute distance. Their argument is based on Dynkin's isomorphism theorem. The purpose of this article is to present an alternative approach to this problem, based only on elementary hitting time estimates and chaining arguments.

We consider backward stochastic differential equations in a setting where noise is generated by a countable state, continuous time Markov chain, and the terminal value is prescribed at a stopping time. We show that, given sufficient integrability of the stopping time and a growth bound on the terminal value and BSDE driver, these equations admit unique solutions satisfying the same growth bound (up to multiplication by a constant). This holds without assuming that the driver is monotone in y, that is, our results do not require that the terminal value be discounted at some uniform rate. We show that the conditions are satisfied for hitting times of states of the chain, and hence present some novel applications of the theory of these BSDEs.

Pairs trading is a trading strategy which is used very frequently in the financial industry. An investment opportunity arises when the spread between two assets, which historically have exhibited autoregressive behavior, deviates from its recent history. In this case, the investor takes a long position in the asset which is expected to outperform going forward and finances this by taking a short position in the other one. If the spread converges, the investor can close both positions to generate a profit. We model the spread between two assets as an Ornstein-Uhlenbeck process and assume a constant opportunity cost. We then study the optimal liquidation strategy for an investor who wants to optimize profit in excess of the opportunity cost. Including this cost is important from an applied perspective, as the performance of any investment is always evaluated relative to the performance of the opportunity set.

Consider a sequence of Markov-dependent trials where each trial produces a letter of a finite alphabet. Given a collection of patterns, we look at this sequence until one of these patterns appears as a run. We show how the method of gambling teams can be employed to compute the probability that a given pattern is the first pattern to occur.

In this note we provide a simple alternative probabilistic derivation of an explicit formula of Kwan and Yang (2007) for the probability of ruin in a risk model with a certain dependence between general claim interoccurrence times and subsequent claim sizes of conditionally exponential type. The approach puts the type of formula in a general context, illustrating the potential for similar simple ruin probability expressions in more general risk models with dependence.