This paper provides a direct approach to obtaining formulas for derivatives of functionals of point processes in rare perturbation analysis ([2], [6]). Results are obtained for arbitrary (not necessarily stationary) point processes in and d, d 2, under transparent conditions, close to minimal. Formulas for higher-order derivatives allow one to construct asymptotical expansions. The results can be useful in sensitivity analysis, in light traffic theory for queues and for computation by simulation of derivatives at positive intensity, while the computation of the derivatives via statistical estimation of the functional itself and its increments usually gives poor results.

We prove existence and uniqueness of a stationary regime for a model of a circuit-switching network with infinitely many nodes.

Branching processes are studied in random environments that are influenced by the population size and approach criticality as the population gets large. Results are applied to the polymerase chain reaction (PCR), which is empirically known to exhibit first exponential and then linear growth of molecule numbers.

Arnold and Laguna introduced a model for income distributions in which the income of the present generation of individuals has the same distribution as the minimum of a random number Nn of independent copies of some random variable and {Nn} is independent. The present paper gives a fairly complete analysis of this model and a number of extensions of it.

In first-passage percolation (FPP) models, the passage time Tℓ from the origin to the point ℓeℓ satisfies f(ℓ) := ETℓ = μℓ + o(ℓ½+ε), where μ ∊ (0,∞) denotes the time constant. Yet, for lattice FPP, it is not known rigorously that f(ℓ) is eventually monotonically increasing. Here, for the Poisson-based Euclidean FPP of Howard and Newman (Prob. Theory Relat. Fields108 (1997), 153–170), we prove an explicit formula for f′(ℓ). In all dimensions, for certain values of the model's only parameter we have f′(ℓ) ≥ C > 0 for large ℓ.

We show that an estimate by de la Peña, Ibragimov, and Jordan for ${\mathbb{E}}(X-c)^+$, with c a constant and X a random variable of which the mean, the variance, and $\mathbb{P}(X \leqslant c)$ are known, implies an estimate by Scarf on the infimum of ${\mathbb{E}}(X \wedge c)$ over the set of positive random variables X with fixed mean and variance. This also shows, as a consequence, that the former estimate implies an estimate by Lo on European option prices.

Stationary Poisson processes of lines in the plane are studied, whose directional distributions are concentrated on $k\geq 3$ equally spread directions. The random lines of such processes decompose the plane into a collection of random polygons, which form a so-called Poisson line tessellation. The focus of this paper is to determine the proportion of triangles in such tessellations, or equivalently, the probability that the typical cell is a triangle. As a by-product, a new deviation of Miles’s classical result for the isotropic case is obtained by an approximation argument.

Motivated by a problem arising in the mining industry, we present a first study of the energy required to reduce a unit mass fragment by consecutively using several devices. Two devices are considered, which we represent as different stochastic fragmentation processes. Following the self-similar energy model introduced in Bertoin and Martínez (2005), we compute the average energy required to attain a size η0 with this two-device procedure. We then asymptotically compare, as η0 goes to 0 or 1, its energy requirement with that of individual fragmentation processes. In particular, we show that, for a certain range of parameters of the fragmentation processes and of their energy cost functions, the consecutive use of two devices can be asymptotically more efficient than using each of them separately, or vice versa.

In this paper, we introduce a generalization of the two-color multitype contact process intended to mimic a biological process called allelopathy. To be precise, we have two types of particle. Particles of each type give birth to particles of the same type, and die at rate 1. When a particle of type 1 dies, it gives way to a frozen site that blocks particles of type 2 for an exponentially distributed amount of time. Specifically, we investigate in detail the phase transitions and the duality properties of the interacting particle system.

In more than four decades of prolific scientific activity, Lajos Takács has produced so much that no one contributor to this Festschrift can hope to cover all of it in a balanced way. I thus propose to make a virtue of necessity, and concentrate on those aspects of Takács' work which have particularly interested or influenced me, and on the impact Takács' ideas in these areas have had on the subsequent development of the subject.

Bartlett and Williams have shown that the hypothesis of the goodness-of-fit of one or more assigned discriminant functions in the case of several groups can be tested using Wilks's A criterion. By factorizing this A criterion suitably, it is also possible to test whether the directions of the given functions are inadequate or whether the number of proposed functions is inadequate. Hotelling's statistic is a competitor of Wilks's A in multivariate analysis; previously its use for this hypothesis and also for the dimensionality and direction aspects of this hypothesis was unknown. The present paper derives the appropriate type statistics for this and also gives their exact null distributions.

We consider a percolation model on the d-dimensional Euclidean space which consists of spheres centred at the points of a Poisson point process of intensity ?. The radii of the spheres are random and are chosen independently and identically according to a distribution of a positive random variable. We show that the percolation function is continuous everywhere except perhaps at the critical point. Further, we show that the percolation functions converge to the appropriate percolation function except at the critical point when the radius random variables are uniformly bounded and converge weakly to another bounded random variable.

In a planar percolation model, faces of the underlying graph, as well as the sites and bonds, may be viewed as random elements. With this viewpoint, Whitney duality allows construction of a planar dual percolation model for each planar percolation model, which applies to mixed models with sites, bonds, and faces open or closed at random. Using self-duality for percolation models on the square lattice, information is obtained about the percolative region in the mixed model.

Central limit theorems are given for the time taken for a population to increase by a factor k > 1 for a supercritical process, or to decrease by a factor k < 1 for a subcritical process. The size of errors is investigated so that confidence limits can be given for these times to O (m½) where m is the population size at t = 0.

The characterization of the exponential distribution via the coefficient of the variation of the blocking time in a queueing system with an unreliable server, as given by Lin (1993), is improved by substantially weakening the conditions. Based on the coefficient of variation of certain random variables, including the blocking time, the normal service time and the minimum of the normal service and the server failure times, two new characterizations of the exponential distribution are obtained.

Some simple methods of estimating inbreeding from tests on a random sample of individuals are discussed. These are mostly iterative procedures, converging to the maximum likelihood estimate, with algorithms for finding standard errors. But there are problems of interpretation, both from the statistical and biological points of view.

The benefit obtained by a selfish robot by cheating in a real multirobotic system can be represented by the random variable Xn,q: the number of cheating interactions needed before all the members in a cooperative team of robots, playing a TIT FOR TAT strategy, recognize the selfish robot. Stability of cooperation depends on the ratio between the benefit obtained by selfish and cooperative robots. In this paper, we establish the probability model for Xn,q. If the values of the parameters n and q are known, then this model allows us to make predictions about the stability of cooperation. Moreover, if these parameters are modifiable, it is possible to tune them to guarantee the viability of cooperation.

We prove the law of large numbers for random walks in random environments on the d-dimensional integer lattice Zd. The environment is described in terms of a stationary random field of transition probabilities on the lattice, possessing a certain drift property, modeled on the Kalikov condition. In contrast to the previously considered models, we admit possible correlation of transition probabilities at different sites, assuming however that they become independent at finite distances. The possible dependence of sites makes impossible a direct application of the renewal times technique of Sznitman and Zerner.

A random collision process with transition probabilities belonging to the same type of distribution is considered. It was proved that if the characteristic function of the initial distribution has a positive radius of convergence, then the sequence {Fn(x)} converges weakly to a distribution G(x) [9]. We define a metric e1[Fn;G], which is analogous to the functional e[f] introduced by Tanaka to Kac's model of Maxwellian gas [10]. We prove that e1[Fn; G] is monotone non-increasing as n → ∞, and also the convergence of the sequence {Fn(x)} under the weaker assumption that for some a > 1 the initial distribution has an ath moment.

The strong law of large numbers of the Marcinkiewicz–Zygmund type is established for the total population in a subcritical branching process with immigration. The moment convergence of the total population is obtained under appropriate moment conditions on the offspring distribution and the immigration distribution.