A simple model of a neuron is proposed, not intended to be biologically faithful, but to incorporate dynamic and stochastic features which seem to be realistic for both the natural and the artificial case. It is shown that the use of feedback for assemblies of such neurons can produce bistable behaviour and sharpen the discrimination of the assembly to the level of input. Particular attention is paid to bistable devices which are to serve as bit-stores (and so constitute components of a memory) and which suffer a disturbing input due to mutual interference. Approximate expressions are obtained for the equilibrium distribution of the excitation level for such assemblies and for the expected escape time of such an assembly from a metastable excitation level.

We study the stochastic comparison of interacting particle systems where the state space of each particle is a finite set endowed with a partial order, and several particles may change their value at a time. For these processes we give local conditions, on the rates of change, that assure their comparability. We also analyze the case where one of the processes does not have any changes that involve several particles, and obtain necessary and sufficient conditions for their comparability. The proofs are based on the explicit construction of an order-preserving Markovian coupling. We show the applicability of our results by studying the stochastic comparison of infinite-station Jackson networks and batch-arrival, batch-service, and assemble-transfer queueing networks.

In this paper we attempt to develop an axiomatic theory of binary structure functions with dependent components. This is an important problem, hitherto largely ignored. The concept of coherent structure in probability is introduced and studied. The relationship to the classical coherent structure is discussed. In the new concept the relevancy is defined through reliability of the system, while in the classical concept it is defined through the structure function.

The wind exerts a sorting effect on particles of sands and, under certain stable conditions that occur frequently but whose nature is little understood, the sorting results in log-size distributions of the hyperbolic form, first noted by R. A. Bagnold. Here, for wind-tunnel experiments a stochastic model is constructed which exhibits a sorting effect deriving from the dependence of distance travelled on the size of the single particle. Under rather specific, experimentally testable assumptions the model reproduces log-size distributions which are of the hyperbolic type and show a variation with distance along the wind tunnel that accords with experimental findings of R. A. Bagnold.

This paper deals with the parity of individuals in an age-dependent birth and death process. A more general model with parity and age-dependent birth rates is also considered. The mean number of individuals with parity 0, 1, 2, ·· ·is obtained for the two models. The first moments of the total number of births in the population up to time t and the sum of the parities of the individuals existing at time t are obtained. A brief discussion on the parity of individuals in a population including ‘twins' is also given.

We present a law of large numbers and a central limit theorem for the time to absorption of Λ-coalescents with dust started from n blocks, as n→∞. The proofs rely on an approximation of the logarithm of the block-counting process by means of a drifted subordinator.

This paper presents a powerful characterisation for the structure of internal vertices of the STIT's I-segments. The characterisation allows certain mathematical analyses to be performed easily. We demonstrate this by deriving new results for various topological properties of the tessellation: for example, the numbers of various types of edge and cell side within the typical I-segment. The characterisation also provides a tool for the calculations of metric properties of the tessellation; many new length distributions and frame-coverage results are given.

A conjecture due to Block et al. (1989), concerning the number of critical connection vectors to the various performance levels of a discrete L-superadditive structure function, is proved. When the components of the discrete L-superadditive structure function are further assumed to satisfy a certain relevance condition due to Griffith (1980), it is shown that there is exactly one critical connection vector to each performance level.

The IFR property of the stochastic process governing a one-component system supported by an inactive standby and a repair facility when the lifetime of one component and the repair time of the other component are dependent, is established. We solve the problem of selecting repair rates to maximize the steady-state availability for given component failure rates when a lower bound for the MTBF and upper bounds for the steady-state expected number of repairs of the components per unit time and expected number of failures of the system per unit time are given.

The Marcinkiewicz strong law, limn→∞(1 / n1/p)∑k=1n(Dk - D) = 0 almost surely with p ∈ (1, 2), is studied for outer products Dk = {XkX̅kT}, where {Xk} and {X̅k} are both two-sided (multivariate) linear processes (with coefficient matrices (Cl), (C̅l) and independent and identically distributed zero-mean innovations {Ξ} and {Ξ̅}). Matrix sequences Cl and C ̅l can decay slowly enough (as |l| → ∞) that {Xk,X ̅k} have long-range dependence, while {Dk} can have heavy tails. In particular, the heavy-tail and long-range-dependence phenomena for {Dk} are handled simultaneously and a new decoupling property is proved that shows the convergence rate is determined by the worst of the heavy tails or the long-range dependence, but not the combination. The main result is applied to obtain a Marcinkiewicz strong law of large numbers for stochastic approximation, nonlinear function forms, and autocovariances.

We consider transport networks with nodes scattered at random in a large domain. At certain local rates, the nodes generate traffic flows according to some navigation scheme in a given direction. In the thermodynamic limit of a growing domain, we present an asymptotic formula expressing the local traffic flow density at any given location in the domain in terms of three fundamental characteristics of the underlying network: the spatial intensity of the nodes together with their traffic generation rates, and of the links induced by the navigation. This formula holds for a general class of navigations satisfying a link-density and a sub-ballisticity condition. As a specific example, we verify these conditions for navigations arising from a directed spanning tree on a Poisson point process with inhomogeneous intensity function.

The ‘coupon collection problem’ refers to a class of occupancy problems in which j identical items are distributed, independently and at random, to n cells, with no restrictions on multiple occupancy. Identifying the cells as coupons, a coupon is ‘collected’ if the cell is occupied by one or more of the distributed items; thus, some coupons may never be collected, whereas others may be collected once or twice or more. We call the number of coupons collected exactly r times coupons of type r. The coupon collection model we consider is general, in that a random number of purchases occurs at each stage of collecting a large number of coupons; the sample sizes at each stage are independent and identically distributed according to a sampling distribution. The joint behavior of the various types is an intricate problem. In fact, there is a variety of joint central limit theorems (and other limit laws) that arise according to the interrelation between the mean, variance, and range of the sampling distribution, and of course the phase (how far we are in the collection processes). According to an appropriate combination of the mean of the sampling distribution and the number of available coupons, the phase is sublinear, linear, or superlinear. In the sublinear phase, the normalization that produces a Gaussian limit law for uncollected coupons can be used to obtain a multivariate central limit law for at most two other types — depending on the rates of growth of the mean and variance of the sampling distribution, we may have a joint central limit theorem between types 0 and 1, or between types 0, 1, and 2. In the linear phase we have a multivariate central limit theorem among the types 0, 1,…, k for any fixed k.

The interpretation of the ‘standard’ Palm version of a stationary random measure ξ is that it behaves like ξ conditioned on containing the origin in its mass. The interpretation of the ‘modified’ Palm version is that it behaves like ξ seen from a typical location in its mass. In this paper we shall focus on the modified Palm version, comparing it with the standard version in the transparent case of mixed biased coin tosses, and then establishing a limit theorem that motivates the above interpretation in the case of random measures on locally compact second countable Abelian groups possessing Følner averaging sets.

Suppose that m drivers each choose a preferred parking space in a linear car park with n spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If all drivers park successfully, the sequence of choices is called a parking function. Classical parking functions correspond to the case $m=n$.

We investigate various probabilistic properties of a uniform parking function. Through a combinatorial construction termed a parking function multi-shuffle, we give a formula for the law of multiple coordinates in the generic situation $m \lesssim n$. We further deduce all possible covariances: between two coordinates, between a coordinate and an unattempted spot, and between two unattempted spots. This asymptotic scenario in the generic situation $m \lesssim n$ is in sharp contrast with that of the special situation $m=n$.

A generalization of parking functions called interval parking functions is also studied, in which each driver is willing to park only in a fixed interval of spots. We construct a family of bijections between interval parking functions with n cars and n spots and edge-labeled spanning trees with $n+1$ vertices and a specified root.

A star-like circuit-switching network with multistage service is considered. Likelihood ratio ordering is used to show that there exists an optimal threshold for the mean number of messages processed through the network as a function of the input traffic intensity.

Preservation of stochastic orders through the system signature has captured the attention of researchers in recent years. Signature-based comparisons have been made for the usual stochastic order, hazard rate order, and likelihood ratio orders. However, for the mean residual life (MRL) order, it has recently been proved that the preservation result does not hold true in general, but rather holds for a particular class of distributions. In this paper, we study whether or not a similar preservation result holds for the mean inactivity time (MIT) order. We prove that the MIT order is not preserved from signatures to system lifetimes with independent and identically distributed (i.i.d.) components, but holds for special classes of distributions. The relationship between these classes and the order statistics is also highlighted. Furthermore, the distribution-free comparison of the performance of coherent systems with dependent and identically distributed (d.i.d.) components is studied under the MIT ordering, using diagonal-dependent copulas and distorted distributions.