A Riesz space-fractional reaction–dispersion equation (RSFRDE) is obtained from the classical reaction–dispersion equation (RDE) by replacing the second-order space derivative with a Riesz derivative of order β∈(1,2]. In this paper, using Laplace and Fourier transforms, we obtain the fundamental solution for a RSFRDE. We propose an explicit finite-difference approximation for a RSFRDE in a bounded spatial domain, and analyse its stability and convergence. Some numerical examples are presented.

While the convergence properties of many sampling selection methods can be proven, there is one particular sampling selection method introduced in Baker (1987), closely related to ‘systematic sampling’ in statistics, that has been exclusively treated on an empirical basis. The main motivation of the paper is to start to study formally its convergence properties, since in practice it is by far the fastest selection method available. We will show that convergence results for the systematic sampling selection method are related to properties of peculiar Markov chains.

Using fluctuation theory, we solve the two-sided exit problem and identify the ruin probability for a general spectrally negative Lévy risk process with tax payments of a loss-carry-forward type. We study arbitrary moments of the discounted total amount of tax payments and determine the surplus level to start taxation which maximises the expected discounted aggregate income for the tax authority in this model. The results considerably generalise those for the Cramér-Lundberg risk model with tax.

We extend a result due to Zazanis (1992) on the analyticity of the expectation of suitable functionals of homogeneous Poisson processes with respect to the intensity of the process. As our main result, we provide Monte Carlo estimators for the derivatives. We apply our results to stochastic models which are of interest in stochastic geometry and insurance.

The paper deals with the asymptotic behavior of the bridge of a Gaussian process conditioned to stay in n fixed points at n fixed past instants. In particular, functional large deviation results are stated for small time. Several examples are considered: integrated or not fractional Brownian motions and m-fold integrated Brownian motion. As an application, the asymptotic behavior of the exit probability is studied and used for the practical purpose of the numerical computation, via Monte Carlo methods, of the hitting probability up to a given time of the unpinned process.

We consider a stochastic SIS model for the spread of an epidemic amongst a population of n individuals that are equally spaced upon the circumference of a circle. Whilst infectious, an individual, i say, makes both local and global infectious contacts at the points of homogeneous Poisson point processes. Global contacts are made uniformly at random with members of the entire population, whilst local contacts are made according to a contact distribution centred upon the infective. Individuals at the end of their infectious period return to the susceptible state and can be reinfected. The emphasis of the paper is on asymptotic results as the population size n → ∞. Therefore, a contact process with global infection is introduced representing the limiting behaviour as n → ∞ of the circle epidemics. A branching process approximation for the early stages of the epidemic is derived and the endemic equilibrium of a major outbreak is obtained. Furthermore, assuming exponential infectious periods, the probability of a major epidemic outbreak and the proportion of the population infectious in the endemic equilibrium are shown to satisfy the same equation which characterises the epidemic process.

We study the exponential utility indifference valuation of a contingent claim B in an incomplete market driven by two Brownian motions. The claim depends on a nontradable asset stochastically correlated with the traded asset available for hedging. We use martingale arguments to provide upper and lower bounds, in terms of bounds on the correlation, for the value V B of the exponential utility maximization problem with the claim B as random endowment. This yields an explicit formula for the indifference value b of B at any time, even with a fairly general stochastic correlation. Earlier results with constant correlation are recovered and extended. The reason why all this works is that, after a transformation to the minimal martingale measure, the value V B enjoys a monotonicity property in the correlation between tradable and nontradable assets.

The diffusion-generator approximation technique developed by De Iorio and Griffiths (2004a) is a very useful method of constructing importance-sampling proposal distributions. Being based on general mathematical principles, the method can be applied to various models in population genetics. In this paper we extend the technique to the neutral coalescent model with recombination, thus obtaining novel sampling distributions for the two-locus model. We consider the case with subdivided population structure, as well as the classic case with only a single population. In the latter case we also consider the importance-sampling proposal distributions suggested by Fearnhead and Donnelly (2001), and show that their two-locus distributions generally differ from ours. In the case of the infinitely-many-alleles model, our approximate sampling distributions are shown to be generally closer to the true distributions than are Fearnhead and Donnelly's.

We study a flexible class of finite-disc process models with interaction between the discs. We let 𝒰 denote the random set given by the union of discs, and use for the disc process an exponential family density with the canonical sufficient statistic depending only on geometric properties of 𝒰 such as the area, perimeter, Euler-Poincaré characteristic, and the number of holes. This includes the quermass-interaction process and the continuum random-cluster model as special cases. Viewing our model as a connected component Markov point process, and thereby establishing local and spatial Markov properties, becomes useful for handling the problem of edge effects when only 𝒰 is observed within a bounded observation window. The power tessellation and its dual graph become major tools when establishing inclusion-exclusion formulae, formulae for computing geometric characteristics of 𝒰, and stability properties of the underlying disc process density. Algorithms for constructing the power tessellation of 𝒰 and for simulating the disc process are discussed, and the software is made public available.

In the classic Dubins-Savage subfair primitive casino gambling problem, the gambler can stake any amount in his possession, winning (1 − r)/r times the stake with probability w and losing the stake with probability 1 − w, 0 ≤ w ≤ r ≤ 1. The gambler seeks to maximize the probability of reaching a fixed fortune (the goal) by gambling repeatedly with suitably chosen stakes. This problem has recently been extended in a unifying framework to account for limited playing time as well as future discounting, under which bold play is known to be optimal provided that w ≤ ½ ≤ r. This paper is concerned with a further extension of the Dubins-Savage gambling problem involving time-dependent parameters, and shows that bold play not only maximizes the probability of reaching the goal, but also stochastically minimizes the number of plays needed to reach the goal. As a result, bold play also maximizes the expected utility, where the utility at the goal is only required to be monotone decreasing with respect to the number of plays needed to reach the goal. It is further noted that bold play remains optimal even when the time-dependent parameters are random.

The problem of finding the probability distribution of the first hitting time of a double integral process (DIP) such as the integrated Wiener process (IWP) has been an important and difficult endeavor in stochastic calculus. It has applications in many fields of physics (first exit time of a particle in a noisy force field) or in biology and neuroscience (spike time distribution of an integrate-and-fire neuron with exponentially decaying synaptic current). The only results available are an approximation of the stationary mean crossing time and the distribution of the first hitting time of the IWP to a constant boundary. We generalize these results and find an analytical formula for the first hitting time of the IWP to a continuous piecewise-cubic boundary. We use this formula to approximate the law of the first hitting time of a general DIP to a smooth curved boundary, and we provide an estimation of the convergence of this method. The accuracy of the approximation is computed in the general case for the IWP and the effective calculation of the crossing probability can be carried out through a Monte Carlo method.

In this paper we show that the continuum-time version of the minority game satisfies the criteria for the application of a theorem on the existence of an invariant measure. We consider the special case of a game with a ‘sufficiently’ asymmetric initial condition, where the number of possible choices for each individual is S = 2 and Γ < +∞. An upper bound for the asymptotic behavior, as the number of agents grows to infinity, of the waiting time for reaching the stationary state is then obtained.

For a linear random field (linear p-parameter stochastic process) generated by a dependent random field with zero mean and finite qth moments (q>2p), we give sufficient conditions that the linear random field converges weakly to a multiparameter standard Brownian motion if the corresponding dependent random field does so.

A random tessellation of ℝd is said to be homogeneous if its distribution is invariant under all shifts of ℝd . The iteration of homogeneous random tessellations is described in a new manner that makes it evident that the resulting random tessellation is homogeneous again. Furthermore, a tessellation-valued process is constructed, the random states of which are homogeneous random tessellations stable under iteration (STIT). It can be interpreted as a process of subsequent division of cells.

The TCP window size process can be modeled as a piecewise-deterministic Markov process that increases linearly and experiences downward jumps at Poisson times. We present a transient analysis of this window size process. Our main result is the Laplace transform of the transient moments. Formulae for the integer and fractional moments are derived, as well as an explicit characterization of the speed of convergence to steady state. Central to our approach are the infinitesimal generator and Dynkin's martingale.

We show that the positive Wiener-Hopf factor of a Lévy process with positive jumps having a rational Fourier transform is a rational function itself, expressed in terms of the parameters of the jump distribution and the roots of an associated equation. Based on this, we give the closed form of the ruin probability for a Lévy process, with completely arbitrary negatively distributed jumps, and finite intensity positive jumps with a distribution characterized by a rational Fourier transform. We also obtain results for the ladder process and its Laplace exponent. A key role is played by the analytic properties of the characteristic exponent of the process and by a Baxter-Donsker-type formula for the positive factor that we derive.

Correlated random walks provide an elementary model for processes that exhibit directional reinforcement behavior. This paper develops optimal multiple stopping strategies - buy/sell rules - for correlated random walks. The work extends previous results given in Allaart and Monticino (2001) by considering random step sizes and allowing possibly negative reinforcement of the walk's current direction. The optimal strategies fall into two general classes - cases where conservative buy-and-hold type strategies are optimal and cases for which it is optimal to follow aggressive trading strategies of successively buying and selling the commodity depending on whether the price goes up or down. Simulation examples are given based on a stock index fund to illustrate the variation in return possible using the theoretically optimal stop rules compared to simpler buy-and-hold strategies.

Let S 0 := 0 and Sk := ξ 1 + ··· + ξk for k ∈ ℕ := {1, 2, …}, where {ξk : k ∈ ℕ} are independent copies of a random variable ξ with values in ℕ and distribution pk := P{ξ = k}, k ∈ ℕ. We interpret the random walk {Sk : k = 0, 1, 2, …} as a particle jumping to the right through integer positions. Fix n ∈ ℕ and modify the process by requiring that the particle is bumped back to its current state each time a jump would bring the particle to a state larger than or equal to n. This constraint defines an increasing Markov chain {Rk (n) : k = 0, 1, 2, …} which never reaches the state n. We call this process a random walk with barrier n. Let Mn denote the number of jumps of the random walk with barrier n. This paper focuses on the asymptotics of Mn as n tends to ∞. A key observation is that, under p 1 > 0, {Mn : n ∈ ℕ} satisfies the distributional recursion M 1 = 0 and for n = 2, 3, …, where In is independent of M 2, …, M n−1 with distribution P{In = k} = pk / (p 1 + ··· + p n−1), k ∈ {1, …, n − 1}. Depending on the tail behavior of the distribution of ξ, several scalings for Mn and corresponding limiting distributions come into play, including stable distributions and distributions of exponential integrals of subordinators. The methods used in this paper are mainly probabilistic. The key tool is to compare (couple) the number of jumps, Mn , with the first time, Nn , when the unrestricted random walk {Sk : k = 0, 1, …} reaches a state larger than or equal to n. The results are applied to derive the asymptotics of the number of collision events (that take place until there is just a single block) for β(a, b)-coalescent processes with parameters 0 < a < 2 and b = 1.

In this paper we present a robust numerical method to compute the scale function W (q)(x) of a general spectrally negative Lévy process (X, P). The method is based on the Esscher transform of measure Pν under which X is taken and the scale function is determined. This change of measure makes it possible for the scale function to be bounded and, hence, makes numerical computation easy, fast, and stable. Working under the new measure Pν and using the method of Abate and Whitt (1992) and Choudhury, Lucantoni, and Whitt (1994), we give a fast stable numerical algorithm for the computation of W (q)(x).

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.