Connections between classification and lumpability in the stochastic Hopfield model (SHM) are explored and developed. A simplification of the SHM's complexity based upon its inherent lumpability is derived. Contributions resulting from this reduction in complexity include: (i) computationally feasible classification time computations; (ii) a development of techniques for enumerating the stationary distribution of the SHM's energy function; and (iii) a characterization of the set of possible absorbing states of the Markov chain associated with the zero temperature SHM.

Consider the Boolean model in ℝ2, where the germs form a homogeneous Poisson point process with intensity λ and the grains are convex compact random sets. It is known (see, e.g., Cressie (1993, Section 9.5.3)) that Laslett's rule transforms the exposed tangent points of the Boolean model into a homogeneous Poisson process with the same intensity. In the present paper, we give a simple proof of this result, which is based on a martingale argument. We also consider the cumulative process of uncovered area in a vertical strip and show that a (linear) Poisson process with intensity λ can be embedded in it.

In this paper, we present the distribution of the coalescence time of two DNA sequences (or genes) subject to symmetric migration between two islands, and conditional on the observed number of segregating sites in the sequences. The distribution for the segregating-site pattern is also obtained. Some surprising results emerge when both genes are initially on the same island. First, the post-data mean coalescence time is shown to be dependent on the migration parameter, as opposed to the pre-data mean. Second, both the post-data density and expectation for the coalescence time are shown to converge, in the weak-migration limit, to the corresponding panmictic results, as opposed to the pre-data situation where there is convergence in the density but not in the expectation. Finally, it is shown that there is convergence in the weak-migration limit in the distribution of the number of segregating sites but not in the expectation and variance. Numerical and graphical results for samples of size greater than two are also presented.

Let D be the punctured unit disk. It is easy to see that no pair x, y in D can cover D in the sense that D cannot be contained in the union of the unit disks centred at x and y. With this fact in mind, let Vn = {X1, X2, …, Xn}, where X1, X2, … are random points sampled independently from a uniform distribution on D. We prove that, with asymptotic probability 1, there exist two points in Vn that cover all of Vn.

Suppose that {Xt} is a Markov chain such as the state space model for a threshold GARCH time series. The regularity assumptions for a drift condition approach to establishing the ergodicity of {Xt} typically are ϕ-irreducibility, aperiodicity, and a minorization condition for compact sets. These can be very tedious to verify due to the discontinuous and singular nature of the Markov transition probabilities. We first demonstrate that, for Feller chains, the problem can at least be simplified to focusing on whether the process can reach some neighborhood that satisfies the minorization condition. The results are valid not just for the transition kernels of Markov chains but also for bounded positive kernels, opening the possibility for new ergodic results. More significantly, we show that threshold GARCH time series and related models of interest can often be embedded into Feller chains, allowing us to apply the conclusions above.

Consider a random walk S=(Sn: n≥0) that is ‘perturbed’ by a stationary sequence (ξn: n≥0) to produce the process S=(Sn+ξn: n≥0). In this paper, we are concerned with developing limit theorems and approximations for the distribution of Mn=max{Sk+ξk: 0≤k≤n} when the random walk has a drift close to 0. Such maxima are of interest in several modeling contexts, including operations management and insurance risk theory. The associated limits combine features of both conventional diffusion approximations for random walks and extreme-value limit theory.

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.

A theorem that gives the optimal control of Gaussian processes using the mathematical expectation of a function of the time and the place where the uncontrolled processes hit the boundary of the stopping region for the first time is proved. The result obtained in this note is an extension of a theorem due to Whittle.

In 2008, Tóth and Vető defined the self-repelling random walk with directed edges as a non-Markovian random walk on $\unicode{x2124}$: in this model, the probability that the walk moves from a point of $\unicode{x2124}$ to a given neighbor depends on the number of previous crossings of the directed edge from the initial point to the target, called the local time of the edge. Tóth and Vető found that this model exhibited very peculiar behavior, as the process formed by the local times of all the edges, evaluated at a stopping time of a certain type and suitably renormalized, converges to a deterministic process, instead of a random one as in similar models. In this work, we study the fluctuations of the local times process around its deterministic limit, about which nothing was previously known. We prove that these fluctuations converge in the Skorokhod $M_1$ topology, as well as in the uniform topology away from the discontinuities of the limit, but not in the most classical Skorokhod topology. We also prove the convergence of the fluctuations of the aforementioned stopping times.

When a stochastic process (a random measure, set, field, etc. on a group) is stationary, ergodic, or reversible, then certain functions of this process inherit these properties. We present sufficient conditions for this inheritance.

We introduce a discrete-time microscopic single-particle model for kinetic transport. The kinetics are modeled by a two-state Markov chain, and the transport is modeled by deterministic advection plus a random space step. The position of the particle after n time steps is given by a random sum of space steps, where the size of the sum is given by a Markov binomial distribution (MBD). We prove that by letting the length of the time steps and the intensity of the switching between states tend to 0 linearly, we obtain a random variable S(t), which is closely connected to a well-known (deterministic) partial differential equation (PDE), reactive transport model from the civil engineering literature. Our model explains (via bimodality of the MBD) the double peaking behavior of the concentration of the free part of solutes in the PDE model. Moreover, we show for instantaneous injection of the solute that the partial densities of the free and adsorbed parts of the solute at time t do exist, and satisfy the PDEs.

Consider a processor-sharing queue placed in a quasi-reversible network in equilibrium. This note explains why the expected sojourn time of a customer in such a queue is proportional to his service time.

Pitman has shown that if X is Brownian motion with maximum process M, then 2M – X is a BES0(3) process. We show that this can be seen by looking at finite-dimensional densities.