This paper is concerned with everywhere local behaviour of certain classes of random processes which have stationary Gaussian increments. It is shown that for two classes of processes almost all the sample functions have the following property. The supremum of the increments in the neighbourhood of a point is everywhere of larger order than the standard deviation. For a third class of processes it is shown that the supremum is at least of the same order as the standard deviation.

Let be a real-valued, homogeneous, and isotropic random field indexed in . When restricted to those indices with , the Euclidean length of , equal to r (a positive constant), then the random field resides on the surface of a sphere of radius r. Using a modified stratified spherical sampling plan (Brown (1993a)) on the sphere, define to be a realization of the random process and to be the cardinality of . A bootstrap algorithm is presented and conditions for strong uniform consistency of the bootstrap cumulative distribution function of the standardized sample mean, , are given. We illustrate the bootstrap algorithm with global land-area data.

This paper deals with censoring of infinite-state banded Markov chains. Censoring involves reducing the time spent in states outside a certain set of states to 0 without affecting the number of visits within this set. We show that, if all states are transient, there is, besides the standard censored Markov chain, a nonstandard censored Markov chain which is stochastic. Both the stochastic and the substochastic solutions are found by censoring a sequence of finite transition matrices. If all matrices in the sequence are stochastic, the stochastic solution arises in the limit, whereas the substochastic solution arises if the matrices in the sequence are substochastic. We also show that, if the Markov chain is recurrent, the only solution is the stochastic solution. Censoring is particularly fruitful when applied to quasi-birth-and-death (QBD) processes. It turns out that key matrices in such processes are not unique, a fact that has been observed by several authors. We note that the stochastic solution is important for the analysis of finite queues.

We construct an immigration-branching process from an inhomogeneous Poisson process, a parameter-dependent probability distribution of populations and a Markov branching process with homogeneous transition function. The set of types is arbitrary, and the parameter is allowed to be discrete or continuous. Assuming a supercritical branching part with primitive first moments and finite second moments, we prove propositions on the mean square convergence and the almost sure convergence of normalized averaging processes associated with the immigration-branching process.

In this paper, the behavior of a Gaussian random field near an ‘upcrossing' of a fixed level is investigated by strengthening the results of Wilson and Adler (1982) to full weak convergence in the space of functions which have continuous derivatives up to order 2. In Section 1, weak convergence and model processes are briefly discussed. The model field of Wilson and Adler (1982) is constructed in Section 2 using full weak convergence. Some of its properties are also investigated. Section 3 contains asymptotic results for the model field, including the asymptotic distributions of the Lebesgue measure of a particular excursion set and the maximum of the model field as the level becomes arbitrarily high.

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 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.

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 present results on the concentration properties of the smoothing and filtering distributions of some partially observed chaotic dynamical systems. We show that, rather surprisingly, for the geometric model of the Lorenz equations, as well as some other chaotic dynamical systems, the smoothing and filtering distributions do not concentrate around the true position of the signal, as the number of observations tends to ∞. Instead, under various assumptions on the observation noise, we show that the expected value of the diameter of the support of the smoothing and filtering distributions remains lower bounded by a constant multiplied by the standard deviation of the noise, independently of the number of observations. Conversely, under rather general conditions, the diameter of the support of the smoothing and filtering distributions are upper bounded by a constant multiplied by the standard deviation of the noise. To some extent, applications to the three-dimensional Lorenz 63 model and to the Lorenz 96 model of arbitrarily large dimension are considered.

A method originating from statistical mechanics (low-density and high-temperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are ‘localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a ‘typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a ‘small perturbation' of the ‘idealized' regime in the totally decoupled network where all the messages have single line paths.

In this paper we compare the distribution of the supremum of the Gaussian random fields Z(P) = ∫CpG(P, P′) dW(P′) and U(P) = ∫CpdW(P'), where CP are circles of fixed radius, dW is a white noise field and G are special deterministic response functions.

The results obtained permit us to establish upper bounds for the distribution of the supremum of Z(P) by applying some well-known inequalities on U(P).

The comparison of the suprema is carried out also, when CP = ℝ2, between fields with different response functions.

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.