Suppose that red and blue points occur in Rd according to two simple point processes with finite intensities λR and λB, respectively. Furthermore, let ν and μ be two probability distributions on the strictly positive integers with means ν̅ and μ̅, respectively. Assign independently a random number of stubs (half-edges) to each red (blue) point with law ν (μ). We are interested in translation-invariant schemes for matching stubs between points of different colors in order to obtain random bipartite graphs in which each point has a prescribed degree distribution with law ν or μ depending on its color. For a large class of point processes, we show that such translation-invariant schemes matching almost surely all stubs are possible if and only if λRν̅ = λBμ̅, including the case when ν̅ = μ̅ = ∞ so that both sides are infinite. Furthermore, we study a particular scheme based on the Gale-Shapley stable marriage problem. For this scheme, we give sufficient conditions on ν and μ for the presence and absence of infinite components. These results are two-color versions of those obtained by Deijfen, Holroyd and Häggström.

In this article we study a biased version of the naming game in which players are located on a connected graph and interact through successive conversations in order to select a common name for a given object. Initially, all the players use the same word B except for one bilingual individual who also uses word A. Both words are attributed a fitness, which measures how often players speak depending on the words they use and how often each word is spoken by bilingual individuals. The limiting behavior depends on a single parameter, ϕ, denoting the ratio of the fitness of word A to the fitness of word B. The main objective is to determine whether word A can invade the system and become the new linguistic convention. From the point of view of the mean-field approximation, invasion of word A is successful if and only if ϕ > 3, a result that we also prove for the process on complete graphs relying on the optimal stopping theorem for supermartingales and random walk estimates. In contrast, for the process on the one-dimensional lattice, word A can invade the system whenever ϕ > 1.053, indicating that the probability of invasion and the critical value for ϕ strongly depend on the degree of the graph. The system on regular lattices in higher dimensions is also studied by comparing the process with percolation models.

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.

The main aim of this paper is to prove the quenched central limit theorem for reversible random walks in a stationary random environment on Z without having the integrability condition on the conductance and without using any martingale. The method shown here is particularly simple and was introduced by Depauw and Derrien [3]. More precisely, for a given realization ω of the environment, we consider the Poisson equation (Pω - I)g = f, and then use the pointwise ergodic theorem in [8] to treat the limit of solutions and then the central limit theorem will be established by the convergence of moments. In particular, there is an analogue to a Markov process with discrete space and the diffusion in a stationary random environment.

Let T be a stopping time associated with a sequence of independent and identically distributed or exchangeable random variables taking values in {0, 1, 2, …, m}, and let ST,i be the stopped sum denoting the number of appearances of outcome 'i' in X1, …, XT, 0 ≤ i ≤ m. In this paper we present results revealing that, if the distribution of T is known, then we can also derive the joint distribution of (T, ST,0, ST,1, …, ST,m). Two applications, which have independent interest, are offered to illustrate the applicability and the usefulness of the main results.

Suppose that X1, …, Xn are random variables with the same known marginal distribution F but unknown dependence structure. In this paper we study the smallest possible value of P(X1 + · · · + Xn < s) over all possible dependence structures, denoted by mn,F(s). We show that mn,F(ns) → 0 for s no more than the mean of F under weak assumptions. We also derive a limit of mn,F(ns) for any s ∈ R with an error of at most n-1/6 for general continuous distributions. An application of our result to risk management confirms that the worst-case value at risk is asymptotically equivalent to the worst-case expected shortfall for risk aggregation with dependence uncertainty. In the last part of this paper we present a dual presentation of the theory of complete mixability and give dual proofs of theorems in the literature on this concept.

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.

Financial data are as a rule asymmetric, although most econometric models are symmetric. This applies also to continuous-time models for high-frequency and irregularly spaced data. We discuss some asymmetric versions of the continuous-time GARCH model, concentrating then on the GJR-COGARCH model. We calculate higher-order moments and extend the first-jump approximation. These results are prerequisites for moment estimation and pseudo maximum likelihood estimation of the GJR-COGARCH model parameters, respectively, which we derive in detail.

Consider the classic infinite-horizon problem of stopping a one-dimensional diffusion to optimise between running and terminal rewards, and suppose that we are given a parametrised family of such problems. We provide a general theory of parameter dependence in infinite-horizon stopping problems for which threshold strategies are optimal. The crux of the approach is a supermodularity condition which guarantees that the family of problems is indexable by a set-valued map which we call the indifference map. This map is a natural generalisation of the allocation (Gittins) index, a classical quantity in the theory of dynamic allocation. Importantly, the notion of indexability leads to a framework for inverse optimal stopping problems.

Simple random walks on a partially directed version of Z2 are considered. More precisely, vertical edges between neighbouring vertices of Z2 can be traversed in both directions (they are undirected) while horizontal edges are one-way. The horizontal orientation is prescribed by a random perturbation of a periodic function; the perturbation probability decays according to a power law in the absolute value of the ordinate. We study the type of simple random walk that is recurrent or transient, and show that there exists a critical value of the decay power, above which it is almost surely recurrent and below which it is almost surely transient.

We study optimal stopping problems related to the pricing of perpetual American options in an extension of the Black-Merton-Scholes model in which the dividend and volatility rates of the underlying risky asset depend on the running values of its maximum and maximum drawdown. The optimal stopping times of the exercise are shown to be the first times at which the price of the underlying asset exits some regions restricted by certain boundaries depending on the running values of the associated maximum and maximum drawdown processes. We obtain closed-form solutions to the equivalent free-boundary problems for the value functions with smooth fit at the optimal stopping boundaries and normal reflection at the edges of the state space of the resulting three-dimensional Markov process. We derive first-order nonlinear ordinary differential equations for the optimal exercise boundaries of the perpetual American standard options.

This paper provides tools for the study of the Dirichlet random walk in Rd. We compute explicitly, for a number of cases, the distribution of the random variable W using a form of Stieltjes transform of W instead of the Laplace transform, replacing the Bessel functions with hypergeometric functions. This enables us to simplify some existing results, in particular, some of the proofs by Le Caër (2010), (2011). We extend our results to the study of the limits of the Dirichlet random walk when the number of added terms goes to ∞, interpreting the results in terms of an integral by a Dirichlet process. We introduce the ideas of Dirichlet semigroups and Dirichlet infinite divisibility and characterize these infinite divisible distributions in the sense of Dirichlet when they are concentrated on the unit sphere of Rd.

Dybvig (1988) introduced the interesting problem of how to construct in the cheapest possible way a terminal wealth with desired distribution. This idea has induced a series of papers concerning generality, consequences, and applications. As the optimized claims typically follow the trend in the market, they are not useful for investors who wish to use them to protect an existing portfolio. For this reason, Bernard, Moraux, Rüschendorf and Vanduffel (2014b) imposed additional state-dependent constraints as a way of controlling the payoff structure. The present paper extends this work in various ways. In order to obtain optimal claims in general models we allow in this paper for extended contracts. We deal with general multivariate price processes and dispense with several of the regularity assumptions in the previous work (in particular, we omit any continuity assumption). State dependence is modeled by requiring terminal wealth to have a fixed copula with a benchmark wealth. In this setting, we are able to characterize optimal claims. We apply the theoretical results to deal with several hedging and expected utility maximization problems of interest.

In Chaudhuri and Dasgupta's 2006 paper a certain stochastic model for ‘replicating character strings’ (such as in DNA sequences) was studied. In their model, a random ‘input’ sequence was subjected to random mutations, insertions, and deletions, resulting in a random ‘output’ sequence. In this paper their model will be set up in a slightly different way, in an effort to facilitate further development of the theory for their model. In their 2006 paper, Chaudhuri and Dasgupta showed that, under certain conditions, strict stationarity of the ‘input’ sequence would be preserved by the ‘output’ sequence, and they proved a similar ‘preservation’ result for the property of strong mixing with exponential mixing rate. In our setup, we will in spirit slightly extend their ‘preservation of stationarity’ result, and also prove a ‘preservation’ result for the property of absolute regularity with summable mixing rate.

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.

We survey some aspects of the classical prediction theory for stationary processes, in discrete time in Section 1, turning in Section 2 to continuous time, with particular reference to reproducing-kernel Hilbert spaces and the sampling theorem. We discuss the discrete-continuous theories of ARMA-CARMA, GARCH-COGARCH, and OPUC-COPUC in Section 3. We compare the various models treated in Section 4 by how well they model volatility, in particular volatility clustering. We discuss the infinite-dimensional case in Section 5, and turn briefly to applications in Section 6.

We observe that the technique of Markov contraction can be used to establish measure concentration for a broad class of noncontracting chains. In particular, geometric ergodicity provides a simple and versatile framework. This leads to a short, elementary proof of a general concentration inequality for Markov and hidden Markov chains, which supersedes some of the known results and easily extends to other processes such as Markov trees. As applications, we provide a Dvoretzky-Kiefer-Wolfowitz-type inequality and a uniform Chernoff bound. All of our bounds are dimension-free and hold for countably infinite state spaces.

We consider a class of optimal stopping problems involving both the running maximum as well as the prevailing state of a linear diffusion. Instead of tackling the problem directly via the standard free boundary approach, we take an alternative route and present a parameterized family of standard stopping problems of the underlying diffusion. We apply this family to delineate circumstances under which the original problem admits a unique, well-defined solution. We then develop a discretized approach resulting in a numerical algorithm for solving the considered class of stopping problems. We illustrate the use of the algorithm in both a geometric Brownian motion and a mean reverting diffusion setting.

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 {an} follow an harmonious and simple asymptotic law of an ∼ kn-αρcn 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.

As the name suggests, the family of general error distributions has been used to model nonnormal errors in a variety of situations. In this article we show that the asymptotic distribution of linearly normalized partial maxima of random observations from the general error distributions is Gumbel when the parameter of these distributions lies in the interval (0, 1). Our result fills a gap in the literature. We also establish the corresponding density convergence, obtain an asymptotic distribution of the partial maxima under power normalization, and state and prove a strong law. We also study the asymptotic behaviour of observations near the partial maxima and the sum of such observations.