bluuebunny/crossref_metadata_2025 huggingface dataset:
On the fractal dimensions of point patterns
Authors: Vere-Jones David
Published: April 2003

When fractal dimensions are estimated from an observed point pattern, there is some ambiguity as to the interpretation of the quantity being estimated. (The point pattern itself has dimension zero.) Two possible interpretations are described. In the first of these, the observation region is regarded as being held fixed, while observations accumulate with time. In this case, provided the process is stationary and ergodic in time, and the cumulants satisfy certain regularity constraints, the dimension estimates consistently estimate the Rényi moment dimensions of the marginal distribution in space. If the regularity constraints are not satisfied, then different limits can be obtained according to the manner in which the limits are taken.

In the second case, the process is regarded as being stationary and ergodic in its spatial component, time being held fixed. In this case the estimates provide consistent estimates of the initial power-law rates of growth of the moment measures of the Palm distribution, the estimates for successively higher Rényi dimensions estimating the growth rates for successively higher-order moment measures of the Palm distribution.

Several examples are given, to illustrate the different types of behaviour which may occur, including the case where the points are generated by a dynamical system.
Interdependences of directional quantities of planar tessellations
Authors: Weiss Viola , Nagel Werner
Published: April 2003

For random planar stationary tessellations a parameter system of three mean values and two directional distributions of the edges is considered. To investigate the interdependences between these parameters their joint range is described, i.e. the set of values which can be realized by tessellations. The constructive proof is based on mixtures of stationary regular tessellations. To explore the range for the class of stationary ergodic tessellations a procedure is used which we refer to as iteration.
The fundamental matrix of singularly perturbed Markov chains
Authors: Avrachenkov Konstantin E. , Lasserre Jean B.
Published: April 2003

We consider a singularly perturbed (finite state) Markov chain and provide a complete characterization of the fundamental matrix. In particular, we obtain a formula for the regular part simpler than a previous formula obtained by Schweitzer, and the singular part is obtained via a reduction process similar to Delebecque's reduction for the stationary distribution. In contrast to previous approaches, one works with aggregate Markov chains of much smaller dimension than the original chain, an essential feature for practical computation. An application to mean first-passage times is also presented.
Weak approximations for empirical Lorenz curves and their Goldie inverses of stationary observations
Authors: Csörgő Miklós , Yu Hao
Published: April 2003

By using Chibisov-O'Reilly type theorems for uniform empirical and quantile processes based on stationary observations, we establish a weak approximation theory for empirical Lorenz curves and their inverses used in economics. In particular, we obtain weak approximations for empirical Lorenz curves and their inverses also under the assumptions of mixing dependence, often used structures of dependence for observations.
Asymptotic properties of the connectivity number of random railways
Authors: Garmo Hans
Published: April 2003

In a cubic multigraph certain restrictions on the paths are made to define what is called a railway. On the tracks in the railway (edges in the multigraph) an equivalence relation is defined. The number of equivalence classes induced by this relation is investigated for a random railway achieved from a random cubic multigraph, and the asymptotic distribution of this number is derived as the number of vertices tends to infinity.
On the algebraic structure in Markovian processes of death and epidemic types
Authors: Picard Philippe , Lefèvre Claude
Published: April 2003

This paper is concerned with the standard bivariate death process as well as with some Markovian modifications and extensions of the process that are of interest especially in epidemic modeling. A new and powerful approach is developed that allows us to obtain the exact distribution of the population state at any point in time, and to highlight the actual nature of the solution. Firstly, using a martingale technique, a central system of relations with two indices for the temporal state distribution will be derived. A remarkable property is that for all the models under consideration, these relations exhibit a similar algebraic structure. Then, this structure will be exploited by having recourse to a theory of Abel-Gontcharoff pseudopolynomials with two indices. This theory generalizes the univariate case examined in a preceding paper and is briefly introduced in the Appendix.
A unified approach to fast teller queues and ATM
Authors: Beck B. , Dabrowski A. R. , McDonald D. R.
Published: April 2003

This paper examines a problem of importance to the telecommunications industry. In the design of modern ATM switches, it is necessary to use simulation to estimate the probability that a queue within the switch exceeds a given large value. Since these are extremely small probabilities, importance sampling methods must be used. Here we obtain a change of measure for a broad class of models with direct applicability to ATM switches.

We consider a model withAindependent sources of cells where each source is modeled by a Markov renewal point process with batch arrivals. We do not assume the sources are necessarily identically distributed, nor that batch sizes are independent of the state of the Markov process. These arrivals join a queue served by multiple independent servers, each with service times also modeled as a Markov renewal process. We only discuss a time-slotted system. The queue is viewed as the additive component of a Markov additive chain subject to the constraint that the additive component remains non-negative. We apply the theory in McDonald (1999) to obtain the asymptotics of the tail of the distribution of the queue size in steady state plus the asymptotics of the mean time between large deviations of the queue size.
Tightness of the stationary waiting time in heavy traffic
Authors: Szczotka Władysław
Published: April 2003

Sufficient conditions are given ensuring tightness of a suitably normalized stationary waiting time in the FIFO G/G/1 queue under heavy traffic.
Three management policies for a resource with partition constraints
Authors: Alanyali Murat
Published: April 2003

Management of a bufferless resource is considered under non-homogeneous demand consisting of one-unit and two-unit requests. Two-unit requests can be served only by a given partition of the resource. Three simple admission policies are evaluated with regard to revenue generation. One policy involves no admission control and two policies involve trunk reservation. A limiting regime in which demand and capacity increase in proportion is considered. It is shown that each policy is asymptotically optimal for a certain range of parameters. Limiting dynamical behavior is obtained via a theory developed by Hunt and Kurtz. The results also point out the remarkable effect of partition constraints.
Interacting particle systems approximations of the Kushner-Stratonovitch equation
Authors: Crişan D. , Del Moral P. , Lyons T. J.
Published: April 2003

In this paper we consider the continuous-time filtering problem and we estimate the order of convergence of an interacting particle system scheme presented by the authors in previous works. We will discuss how the discrete time approximating model of the Kushner-Stratonovitch equation and the genetic type interacting particle system approximation combine. We present quenched error bounds as well as mean order convergence results.
Hunting submartingales in the jumping voter model and the biased annihilating branching process
Authors: Sudbury Aidan
Published: April 2003

Two species (designated by 0's and 1's) compete for territory on a lattice according to the rules of a voter model, except that the 0's jump
d0 spaces and the 1's jump d1 spaces. When
d0 = d1 = 1 the model is the usual voter model. It is shown that in one dimension, if d1 >
d0 and d0 = 1,2 and initially there are infinitely many blocks of 1's of length ≥ d1, then the 1's eliminate the 0's. It is believed this may be true whenever
d1 > d0. In the biased annihilating branching process particles place offspring on empty neighbouring sites at rate λ and neighbouring pairs of particles coalesce at rate 1. In one dimension it is known to converge to the product measure density λ/(1+λ) when λ ≥ 1/3, and the initial configuration is non-zero and finite. This result is extended to λ ≥ 0.0347. Bounds on the edge-speed are given.
Stochastic analysis of image acquisition, interpolation and scale-space smoothing
Authors: Åström Kalle , Heyden Anders
Published: April 2003

In the high-level operations of computer vision it is taken for granted that image features have been reliably detected. This paper addresses the problem of feature extraction by scale-space methods. There has been a strong development in scale-space theory and its applications to low-level vision in the last couple of years. Scale-space theory for continuous signals is on a firm theoretical basis. However, discrete scale-space theory is known to be quite tricky, particularly for low levels of scale-space smoothing. The paper is based on two key ideas: to investigate the stochastic properties of scale-space representations and to investigate the interplay between discrete and continuous images. These investigations are then used to predict the stochastic properties of sub-pixel feature detectors.

The modeling of image acquisition, image interpolation and scale-space smoothing is discussed, with particular emphasis on the influence of random errors and the interplay between the discrete and continuous representations. In doing so, new results are given on the stochastic properties of discrete and continuous random fields. A new discrete scale-space theory is also developed. In practice this approach differs little from the traditional approach at coarser scales, but the new formulation is better suited for the stochastic analysis of sub-pixel feature detectors.

The interpolated images can then be analysed independently of the position and spacing of the underlying discretisation grid. This leads to simpler analysis of sub-pixel feature detectors. The analysis is illustrated for edge detection and correlation. The stochastic model is validated both by simulations and by the analysis of real images.
Existence of ‘nearest-neighbour’ spatial Gibbs models
Authors: Bertin Etienne , Billiot Jean-Michel , Drouilhet Rémy
Published: April 2003

The present study deals with the existence of ‘nearest-neighbour’ type Gibbs models, introduced by Baddeley and Møller in 1989. In such models, the neighbourhood relation depends on the realization of the process. After giving new sufficient conditions to prove the existence of stationary Gibbs states, we deal with the first-nearest-neighbour model, the triplets Delaunay model, Ord's model and Markov connected component type models.
Bounds for clump size characteristics in the Boolean model
Authors: Błaszczyszyn Bartłomiej , Rau Christian , Schmidt Volker
Published: April 2003

A random spatial coverage process whose generating point process is homogeneous Poisson, and whose attached random sets are independent and identically distributed, is called a Boolean model. Motivated by Błaszczyszyn et al. [1], distributional and higher moment properties of the size of clumps (connected clusters of overlapping sets) in this model are derived. This provides some complements to the result on the finiteness of the first moment presented in Hall [3]. The key idea is to construct a certain coupling process for a multitype branching process that dominates the clump size.
Generalized Gamma measures and shot-noise Cox processes
Authors: Brix Anders
Published: April 2003

A parametric family of completely random measures, which includes gamma random measures, positive stable random measures as well as inverse Gaussian measures, is defined. In order to develop models for clustered point patterns with dependencies between points, the family is used in a shot-noise construction as intensity measures for Cox processes. The resulting Cox processes are of Poisson cluster process type and include Poisson processes and ordinary Neyman-Scott processes.

We show characteristics of the completely random measures, illustrated by simulations, and derive moment and mixing properties for the shot-noise random measures. Finally statistical inference for shot-noise Cox processes is considered and some results on nearest-neighbour Markov properties are given.
Four interesting problems concerning Markovian shape sequences
Authors: Cowan Richard , Chen Francis K. C.
Published: April 2003

In earlier work, we investigated the dynamics of shape when rectangles are split into two. Further exploration, into the more general issues of Markovian sequences of rectangular shapes, has identified four particularly appealing problems. These problems, which lead to interesting invariant distributions on [0,1], have motivating links with the classical works of Blaschke, Crofton, D. G. Kendall, Rényi and Sulanke.
The central limit theorem for Euclidean minimal spanning trees II
Authors: Lee Sungchul
Published: April 2003

Let Xi : i ≥ 1 be i.i.d. points in ℝd, d ≥ 2, and let Tn be a minimal spanning tree on X1,…,Xn. Let L(X1,…,Xn) be the length of Tn and for each strictly positive integer α let N(X1,…,Xn;α) be the number of vertices of degree α in Tn. If the common distribution satisfies certain regularity conditions, then we prove central limit theorems for L(X1,…,Xn) and N(X1,…,Xn;α). We also study the rate of convergence for EL(X1,…,Xn).
The distribution of volume reductions induced by isotropic random projections
Authors: Nielsen Jørgen
Published: April 2003

In this paper, isotropic random projections of d-sets in ℝn are studied, where a d-set is a subset of a d-dimensional affine subspace which satisfies certain regularity conditions. The squared volume reduction induced by the projection of a d-set onto an isotropic random p-subspace is shown to be distributed as a product of independent beta-distributed random variables, for d ≤ p. One of the proofs of this result uses Wilks' lambda distribution from multivariate normal theory. The result is related to Cauchy's and Crofton's formulae in stochastic geometry. In particular, it can be used to give a new and quite simple proof of one of the classical Crofton intersection formulae.
Surprising optimal estimators for the area fraction
Authors: Schladitz Katja
Published: April 2003

For a random closed setXand a compact observation windowWthe mean coverage fraction ofWcan be estimated by measuring the area ofWcovered byX. Jensen and Gundersen, and Baddeley and Cruz-Orive described cases where a point counting estimator is more efficient than area measurement. We give two other examples, where at first glance unnatural estimators are not only better than the area measurement but by Grenander's Theorem have minimal variance. Whittle's Theorem is used to show that the point counting estimator in the original Jensen-Gundersen paradox is optimal for large randomly translated discs.
Recent common ancestors of all present-day individuals
Authors: Chang Joseph T.
Published: April 2003

Previous study of the time to a common ancestor of all present-day individuals has focused on models in which each individual has just one parent in the previous generation. For example, ‘mitochondrial Eve’ is the most recent common ancestor (MRCA) when ancestry is defined only through maternal lines. In the standard Wright-Fisher model with population size n, the expected number of generations to the MRCA is about 2n, and the standard deviation of this time is also of order n. Here we study a two-parent analog of the Wright-Fisher model that defines ancestry using both parents. In this model, if the population size n is large, the number of generations, 𝒯n, back to a MRCA has a distribution that is concentrated around lgn (where lg denotes base-2 logarithm), in the sense that the ratio 𝒯n(lgn) converges in probability to 1 as n→∞. Also, continuing to trace back further into the past, at about 1.77 lgn generations before the present, all partial ancestry of the current population ends, in the following sense: with high probability for large n, in each generation at least 1.77lgn generations before the present, all individuals who have any descendants among the present-day individuals are actually ancestors of all present-day individuals.
Multi-resolution approximation to the stochastic inverse problem
Authors: Angulo J. M. , Ruiz-Medina M. D.
Published: April 2003

The linear inverse problem of estimating the input random field in a first-kind stochastic integral equation relating two random fields is considered. For a wide class of integral operators, which includes the positive rational functions of a self-adjoint elliptic differential operator on L2(ℝd), the ill-posed nature of the problem disappears when such operators are defined between appropriate fractional Sobolev spaces. In this paper, we exploit this fact to reconstruct the input random field from the orthogonal expansion (i.e. with uncorrelated coefficients) derived for the output random field in terms of wavelet bases, transformed by a linear operator factorizing the output covariance operator. More specifically, conditions under which the direct orthogonal expansion of the output random field coincides with the integral transformation of the orthogonal expansion derived for the input random field, in terms of an orthonormal wavelet basis, are studied.
Incomplete markets: convergence of options values under the minimal martingale measure
Authors: Prigent Jean-Luc
Published: April 2003

In the setting of incomplete markets, this paper presents a general result of convergence for derivative assets prices. It is proved that the minimal martingale measure first introduced by Föllmer and Schweizer is a convenient tool for the stability under convergence. This extends previous well-known results when the markets are complete both in discrete time and continuous time. Taking into account the structure of stock prices, a mild assumption is made. It implies the joint convergence of the sequences of stock prices and of the Radon-Nikodym derivative of the minimal measure. The convergence of the derivatives prices follows.

This property is illustrated in the main classes of financial market models.
Stochastic comparisons for residual lifetimes and Bayesian notions of multivariate ageing
Authors: Bassan Bruno , Spizzichino Fabio
Published: April 2003

We compare distributions of residual lifetimes of dependent components of different age. This approach yields several notions of multivariate ageing. A special feature of our notions is that they are based on one-dimensional stochastic comparisons. Another difference from the traditional approach is that we do not condition on different histories.
Optimal stochastic scheduling of a two-stage tandem queue with parallel servers
Authors: Ahn Hyun-Soo , Duenyas Izak , Zhang Rachel Q.
Published: April 2003

We consider the optimal stochastic scheduling of a two-stage tandem queue with two parallel servers. The servers can serve either queue at any point in time and the objective is to minimize the total holding costs incurred until all jobs leave the system. We characterize sufficient and necessary conditions under which it is optimal to allocate both servers to the upstream or downstream queue. We then conduct a numerical study to investigate whether the results shown for the static case also hold for the dynamic case. Finally, we provide a numerical study that explores the benefits of having two flexible parallel servers which can work at either queue versus servers dedicated to each queue. We discuss the results' implications for cross-training workers to perform multiple tasks.
On the optimality and the asymptotic optimality of the smallest weighted available buffer policy
Authors: Lee Duan-Shin
Published: April 2003

A major design challenge of Asynchronous Transfer Mode (ATM) networks is to efficiently provide the quality of service (QOS) specified by users with different demands. We classify sources so that sources in one class join the same buffer and have the same requirement for the ATM cell loss ratio. It is important to search for the service discipline that minimizes the accumulated cell loss under the constraint that the cell loss ratios of the sources are proportional to their QOS requirements. In this paper we consider a model that hasNfinite buffers and a single server. Bufferi, of sizeBi, is assigned a positive numberwi. The server serves from one of the non-empty buffers whose indices are equal to argminwi(Bi-Qi), whereQiis the queue length of bufferi. This scheduling policy is called the smallest weighted available buffer policy (SWAB). We show that in a completely symmetric setting, the SWAB policy minimizes the discounted expected loss of cells under some technical conditions. For asymmetric models, we show that the accumulated loss of cells of the SWAB service discipline is asymptotically optimal under heavy traffic conditions in the diffusion limit. Finally, we obtain the expression ofwiso that the cell loss ratios of the sources in the diffusion limit are proportional to their QOS requirements.
Variance prediction for pseudosystematic sampling on the sphere
Authors: Gual-Arnau Ximo , Cruz-Orive Luis M.
Published: April 2003

Geometric sampling, and local stereology in particular, often require observations at isotropic random directions on the sphere, and some sort of systematic design on the sphere becomes necessary on grounds of efficiency and practical applicability. Typically, the relevant probes are of nucleator type, in which several rays may be contained in a sectioning plane through a fixed point (e.g. through a nucleolus within a biological cell). The latter requirement considerably reduces the choice of design in practice; in this paper, we concentrate on a nucleator design based on splitting the sphere into regions of equal area, but not of identical shape; this design is pseudosystematic rather than systematic in a strict sense. Firstly, we obtain useful exact representations of the variance of an estimator under pseudosystematic sampling on the sphere. Then we adopt a suitable covariogram model to obtain a variance predictor from a single sample of arbitrary size, and finally we examine the prediction accuracy by way of simulation on a synthetic particle model.
A note on design-based versus model-based variance estimation in stereology
Authors: Hobolth Asger , Jensen Eva B. Vedel
Published: April 2003

Recently, systematic sampling on the circle and the sphere has been studied by Gual-Arnau and Cruz-Orive (2000) from a design-based point of view. In this note, it is shown that their mathematical model for the covariogram is, in a model-based statistical setting, a special case of the p-order shape model suggested by Hobolth, Pedersen and Jensen (2000) and Hobolth, Kent and Dryden (2002) for planar objects without landmarks. Benefits of this observation include an alternative variance estimator, applicable in the original problem of systematic sampling. In a wider perspective, the paper contributes to the discussion concerning design-based versus model-based stereology.
A two-dimensional random crystalline algorithm for Gauss curvature flow
Authors: Ishii H. , Mikami T.
Published: April 2003

We propose and study a random crystalline algorithm (a discrete approximation) of the Gauss curvature flow of smooth simple closed convex curves in ℝ2 as a stepping stone to the full understanding of such phenomena as the wearing process of stones on a beach.
Determination of the mean normal measure from isotropic means of flat sections
Authors: Kiderlen Markus
Published: April 2003

Letbe the mean normal measure of a stationary random setZin the extended convex ring in ℝd. Fork∈ {1,…,d-1}, connections are shown betweenand the mean of. Here, the mean is understood to be with respect to the random isotropick-dimensional linear subspace ξkand the mean normal measure of the intersection is computed in ξk. This mean to be well defined, a suitable spherical lifting must be applied tobefore averaging. A large class of liftings and their resulting means are discussed. In particular, a geometrically motivated lifting is presented, for which the mean of liftings ofdeterminesuniquely for any fixedk∈ {2,…,d-1}.
Variance asymptotics and central limit theorems for volumes of unions of random closed sets
Authors: Schreiber Tomasz
Published: April 2003

Let X, X1, X2, … be a sequence of i.i.d. random closed subsets of a certain locally compact, Hausdorff and separable base space E. For a fixed normalised Borel measure μ on E, we investigate the behaviour of random variables μ(E \ (X1 ∪ ∙ ∙ ∙ ∪ Xn)) for large n. The results obtained include a description of variance asymptotics, strong law of large numbers and a central limit theorem. As an example we give an application of the developed methods for asymptotic analysis of the mean width of convex hulls generated by uniform samples from a multidimensional ball. Another example deals with unions of random balls in ℝd with centres distributed according to a spherically-symmetric heavy-tailed law.
Arbitrage in continuous complete markets
Authors: Platen Eckhard
Published: April 2003

This paper introduces a benchmark approach for the modelling of continuous, complete financial markets, when an equivalent risk-neutral measure does not exist. This approach is based on the unique characterization of a benchmark portfolio, the growth optimal portfolio, which is obtained via a generalization of the mutual fund theorem. The discounted growth optimal portfolio with minimum variance drift is shown to follow a Bessel process of dimension four. Some form of arbitrage can be explicitly modelled by arbitrage amounts. Fair contingent claim prices are derived as conditional expectations under the real world probability measure. The Heath-Jarrow-Morton forward rate equation remains valid despite the absence of an equivalent risk neutral measure.
Error bounds on multivariate Normal approximations for word count statistics
Authors: Huang Haiyan
Published: April 2003

Given a sequenceSand a collection Ω ofdwords, it is of interest in many applications to characterize the multivariate distribution of the vector of countsU= (N(S,w1), …,N(S,wd)), whereN(S,w) is the number of times a wordw∈ Ω appears in the sequenceS. We obtain an explicit bound on the error made when approximating the multivariate distribution ofUby the normal distribution, when the underlying sequence is i.i.d. or first-order stationary Markov over a finite alphabet. When the limiting covariance matrix ofUis nonsingular, the error bounds decay at rateO((logn) / √n) in the i.i.d. case andO((logn)3/ √n) in the Markov case. In order forUto have a nondegenerate covariance matrix, it is necessary and sufficient that the counted word set Ω is notfull, that is, that Ω is not the collection of all possible words of some lengthkover the given finite alphabet. To supply the bounds on the error, we use a version of Stein's method.
Multivariate extremes, aggregation and dependence in elliptical distributions
Authors: Hult Henrik , Lindskog Filip
Published: April 2003

In this paper, we clarify dependence properties of elliptical distributions by deriving general but explicit formulae for the coefficients of upper and lower tail dependence and spectral measures with respect to different norms. We show that an elliptically distributed random vector is regularly varying if and only if the bivariate marginal distributions have tail dependence. Furthermore, the tail dependence coefficients are fully determined by the tail index of the random vector (or equivalently of its components) and the linear correlation coefficient. Whereas Kendall's tau is invariant in the class of elliptical distributions with continuous marginals and a fixed dispersion matrix, we show that this is not true for Spearman's rho. We also show that sums of elliptically distributed random vectors with the same dispersion matrix (up to a positive constant factor) remain elliptical if they are dependent only through their radial parts.
Poisson approximation for a sum of dependent indicators: an alternative approach
Authors: Papadatos N. , Papathanasiou V.
Published: April 2003

The random variablesX1,X2, …,Xnare said to be totally negatively dependent (TND) if and only if the random variablesXiand ∑j≠iXjare negatively quadrant dependent for alli. Our main result provides, for TND 0-1 indicatorsX1,x2, …,Xnwith P[Xi= 1] =pi= 1 - P[Xi= 0], an upper bound for the total variation distance between ∑ni=1Xiand a Poisson random variable with mean λ ≥ ∑ni=1pi. An application to a generalized birthday problem is considered and, moreover, some related results concerning the existence of monotone couplings are discussed.
On a tandem G-network with blocking
Authors: Gómez-Corral A.
Published: April 2003

An important class of queueing networks is characterized by the following feature: in contrast with ordinary units, a disaster may remove all work from the network. Applications of such networks include computer networks with virus infection, migration processes with mass exodus and serial production lines with catastrophes. In this paper, we deal with a two-stage tandem queue with blocking operating under the presence of a secondary flow of disasters. The arrival flows of units and disasters are general Markovian arrival processes. Using spectral analysis, we determine the stationary distribution at departure epochs. That distribution enables us to derive the distribution of the number of units which leave the network at a disaster epoch. We calculate the stationary distribution at an arbitrary time and, finally, we give numerical results and graphs for certain probabilistic descriptors of the network.
Countable-state-space Markov chains with two time scales and applications to queueing systems
Authors: Yin G. , Zhang Hanqin
Published: April 2003

Motivated by various applications in queueing systems, this work is devoted to continuous-time Markov chains with countable state spaces that involve both fast-time scale and slow-time scale with the aim of approximating the time-varying queueing systems by their quasistationary counterparts. Under smoothness conditions on the generators, asymptotic expansions of probability vectors and transition probability matrices are constructed. Uniform error bounds are obtained, and then sequences of occupation measures and their functionals are examined. Mean square error estimates of a sequence of occupation measures are obtained; a scaled sequence of functionals of occupation measures is shown to converge to a Gaussian process with zero mean. The representation of the variance of the limit process is also explicitly given. The results obtained are then applied to treat Mt/Mt/1 queues and Markov-modulated fluid buffer models.
Markov connected component fields
Authors: Møller Jesper , Waagepetersen Rasmus Plenge
Published: April 2003

A new class of Gibbsian models with potentials associated with the connected components or homogeneous parts of images is introduced. For these models the neighbourhood of a pixel is not fixed as for Markov random fields, but is given by the components which are adjacent to the pixel. The relationship to Markov random fields and marked point processes is explored and spatial Markov properties are established. Extensions to infinite lattices are also studied, and statistical inference problems including geostatistical applications and statistical image analysis are discussed. Finally, simulation studies are presented which show that the models may be appropriate for a variety of interesting patterns, including images exhibiting intermediate degrees of spatial continuity and images of objects against background.
On the distribution of the spherical contact vector of stationary germ-grain models
Authors: Last G. , Schassberger R.
Published: April 2003

We consider a stationary germ-grain model Ξ with convex and compact grains and the distance r(x) from x ε ℝd to Ξ. For almost all points x ε ℝd there exists a unique point p(x) in the boundary of Ξ such that r(x) is the length of the vector x-p(x), which is called the spherical contact vector at x. In this paper we relate the distribution of the spherical contact vector to the times it takes a typical boundary point of Ξ to hit another grain if all grains start growing at the same time and at the same speed. The notion of a typical point is made precise by using the generalized curvature measures of Ξ. The result generalizes a well known formula for the Boolean model. Specific examples are discussed in detail.
On the consistency of procrustean mean shapes
Authors: Le Huiling
Published: April 2003

We discuss the uniqueness of the Fréchet mean of a class of distributions on the shape space ofklabelled points in ℝ2, the supports of which could be the entire space. From this it follows that the shape of the means is the unique Fréchet mean shape of the induced distribution with respect to an appropriate metric structure, provided the distribution ofklabelled points in ℝ2is isotropic and satisfies a further mild condition. This result implies that an increasing sequence of procrustean mean shapes defined in either of the two ways used in practice will tend almost surely to the shape of the means.
Bayesian object recognition with baddeley's delta loss
Authors: Rue Håvard , Syversveen Anne Randi
Published: April 2003

A common problem in Bayesian object recognition using marked point process models is to produce a point estimate of the true underlying object configuration: the number of objects and the size, location and shape of each object. We use decision theory and the concept of loss functions to design a more reasonable estimator for this purpose, rather than using the common zero-one loss corresponding to themaximum a posterioriestimator. We propose to use the squared Δ-metric of Baddeley (1992) as our loss function and demonstrate that the corresponding optimal Bayesian estimator can be well approximated by combining Markov chain Monte Carlo methods with simulated annealing into a two-step algorithm. The proposed loss function is tested using a marked point process model developed for locating cells in confocal microscopy images.
Fixed points of a generalized smoothing transformation and applications to the branching random walk
Authors: Liu Quansheng
Published: April 2003

Let {Ai:i≥ 1} be a sequence of non-negative random variables and letMbe the class of all probability measures on [0,∞]. Define a transformationTonMby lettingTμ be the distribution of ∑i=1∞AiZi, where theZiare independent random variables with distribution μ, which are also independent of {Ai}. Under first moment assumptions imposed on {Ai}, we determine exactly whenThas a non-trivial fixed point (of finite or infinite mean) and we prove that all fixed points have regular variation properties; under moment assumptions of order 1 + ε, ε > 0, we findallthe fixed points and we prove that all non-trivial fixed points have stable-like tails. Convergence theorems are given to ensure that each non-trivial fixed point can be obtained as a limit of iterations (byT) with an appropriate initial distribution; convergence to the trivial fixed points δ0and δ∞is also examined, and a result like the Kesten-Stigum theorem is established in the case where the initial distribution has the same tails as a stable law. The problem of convergence with an arbitrary initial distribution is also considered when there is no non-trivial fixed point. Our investigation has applications in the study of: (a) branching processes; (b) invariant measures of some infinite particle systems; (c) the model for turbulence of Yaglom and Mandelbrot; (d) flows in networks and Hausdorff measures in random constructions; and (e) the sorting algorithm Quicksort. In particular, it turns out that the basic functional equation in the branching random walk always has a non-trivial solution.
A central limit theorem for random coefficient autoregressive models and ARCH/GARCH models
Authors: Rudolph Andreas
Published: April 2003

In this paper we study the so-called random coeffiecient autoregressive models (RCA models) and (generalized) autoregressive models with conditional heteroscedasticity (ARCH/GARCH models). Both models can be represented as random systems with complete connections. Within this framework we are led (under certain conditions) to CL-regular Markov processes and we will give conditions under which (i) asymptotic stationarity, (ii) a law of large numbers and (iii) a central limit theorem can be shown for the corresponding models.
Finite-horizon dynamic optimisation when the terminal reward is a concave functional of the distribution of the final state
Authors: Collins E. J. , McNamara J. M.
Published: April 2003

We consider a problem similar in many respects to a finite horizon Markov decision process, except that the reward to the individual is a strictly concave functional of the distribution of the state of the individual at final time T. Reward structures such as these are of interest to biologists studying the fitness of different strategies in a fluctuating environment. The problem fails to satisfy the usual optimality equation and cannot be solved directly by dynamic programming. We establish equations characterising the optimal final distribution and an optimal policy π*. We show that in general π* will be a Markov randomised policy (or equivalently a mixture of Markov deterministic policies) and we develop an iterative, policy improvement based algorithm which converges to π*. We also consider an infinite population version of the problem, and show that the population cannot do better using a coordinated policy than by each individual independently following the individual optimal policy π*.
The dynamic system method and the traps
Authors: Brandière Odile
Published: April 2003

We transpose the ordinary differential equation method (used for decreasing stepsize stochastic algorithms) to a dynamical system method to study dynamical systems disturbed by a noise decreasing to zero. We prove that such an algorithm does not fall into a regular trap if the noise is exciting in an unstable direction.
Periodic steady state of loss systems with periodic inputs
Authors: Willie Helmut
Published: April 2003

The input of a multiserver loss system is assumed to be a periodic random marked point process which has, with probability one, infinitely many construction points. It is shown that, independently of the initial distribution, there exists a unique periodic process modeling the periodic steady-state behaviour of the loss system. In addition, practical sufficient conditions for the existence of enough construction points are derived.
The moments of the number of exits from a simply connected region
Authors: Illsley Robert
Published: April 2003

We generalise the work of Cramér and Leadbetter, Ylvisaker and Ito on the level crossings of a stationary Gaussian process to multivariate processes. Necessary and sufficient conditions for the existence of the expected number of crossingsE(C) of the boundary of a region of ℝpby a stationary vector stochastic process are obtained, along with an explicit formula forE(C) in the Gaussian case. A rigorous proof of Belyaev's integral formula for the factorial moments of the number of exits from a region of ℝpis given for a class of processes which includes Gaussian processes having a finite second order spectral moment matrix. Applications to χ2processes are briefly considered.
On the rate of growth of the overshoot and the maximum partial sum
Authors: Griffin P. S. , Maller R. A.
Published: April 2003

Let Tr be the first time at which a random walk Sn escapes from the strip [-r,r], and let |STr|-r be the overshoot of the boundary of the strip. We investigate the order of magnitude of the overshoot, as r → ∞, by providing necessary and sufficient conditions for the ‘stability’ of |STr|, by which we mean that |STr|/r converges to 1, either in probability (weakly) or almost surely (strongly), as r → ∞. These also turn out to be equivalent to requiring only the boundedness of |STr|/r, rather than its convergence to 1, either in the weak or strong sense, as r → ∞. The almost sure characterisation turns out to be extremely simple to state and to apply: we have |STr|/r → 1 a.s. if and only if EX2 < ∞ and EX = 0 or 0 < |EX| ≤ E|X| < ∞. Proving this requires establishing the equivalence of the stability of STr with certain dominance properties of the maximum partial sum Sn* = max{|Sj|: 1 ≤ j ≤ n} over its maximal increment.
Concomitant tail behaviour for extremes
Authors: Ledford Anthony W. , Tawn Jonathan A.
Published: April 2003

The influence of bivariate extremal dependence on the limiting behaviour of the concomitant of the largest order statistic is examined. Our approach is to fix the marginal distributions and derive a general tail characterisation of the joint survivor function. From this, we identify the normalisation required to obtain the limiting distribution of the concomitant of the largest order statistic, obtain its tail form, and investigate the limiting probability that the vector of componentwise maxima occurs as an observation of the bivariate process. The results are illustrated for a range of extremal dependence forms.
The return on investment from proportional portfolio strategies
Authors: Browne Sid
Published: April 2003

Dynamic asset allocation strategies that are continuously rebalanced so as to always keep a fixed constant proportion of wealth invested in the various assets at each point in time play a fundamental role in the theory of optimal portfolio strategies. In this paper we study the rate of return on investment, defined here as the net gain in wealth divided by the cumulative investment, for such investment strategies in continuous time. Among other results, we prove that the limiting distribution of this measure of return is a gamma distribution. This limit theorem allows for comparisons of different strategies. For example, the mean return on investment is maximized by the same strategy that maximizes logarithmic utility, which is also known to maximize the exponential rate at which wealth grows. The return from this policy turns out to have other stochastic dominance properties as well. We also study the return on the risky investment alone, defined here as the present value of the gain from investment divided by the present value of the cumulative investment in the risky asset needed to achieve the gain. We show that for the log-optimal, or optimal growth policy, this return tends to an exponential distribution. We compare the return from the optimal growth policy with the return from a policy that invests a constant amount in the risky stock. We show that for the case of a single risky investment, the constant investor's expected return is twice that of the optimal growth policy. This difference can be considered the cost for insuring that the proportional investor does not go bankrupt.
Hedging contingent claims for a large investor in an incomplete market
Authors: Buckdahn Rainer , Hu Ying
Published: April 2003

In this paper we study the problem of pricing contingent claims for a large investor (i.e. the coefficients of the price equation can also depend on the wealth process of the hedger) in an incomplete market where the portfolios are constrained. We formulate this problem so as to find the minimal solution of forward-backward stochastic differential equations (FBSDEs) with constraints. We use the penalization method to construct a sequence of FBSDEs without constraints, and we show that the solutions of these equations converge to the minimal solution we are interested in.
Complications with stochastic volatility models
Authors: Sin Carlos A.
Published: April 2003

We show a class of stock price models with stochastic volatility for which the most natural candidates for martingale measures are only strictly local martingale measures, contrary to what is usually assumed in the finance literature. We also show the existence of equivalent martingale measures, and provide one explicit example.
On the Hausdorff distance between a convex set and an interior random convex hull
Authors: Bräker H. , Hsing T. , Bingham N. H.
Published: April 2003

The problem of estimating an unknown compact convex set K in the plane, from a sample (X1,···,Xn) of points independently and uniformly distributed over K, is considered. Let Kn be the convex hull of the sample, Δ be the Hausdorff distance, and Δn := Δ (K, Kn). Under mild conditions, limit laws for Δn are obtained. We find sequences (an), (bn) such that

(Δn - bn)/an → Λ (n → ∞), where Λ is the Gumbel (double-exponential) law from extreme-value theory. As expected, the directions of maximum curvature play a decisive role. Our results apply, for instance, to discs and to the interiors of ellipses, although for eccentricity e < 1 the first case cannot be obtained from the second by continuity. The polygonal case is also considered.
A diffusion model for bookstein triangle shape
Authors: Kendall Wilfrid S.
Published: April 2003

A stochastic dynamical context is developed for Bookstein's shape theory. It is shown how Bookstein's shape space for planar triangles arises naturally when the landmarks are moved around by a special Brownian motion on the general linear group of invertible (2×2) real matrices. Asymptotics for the Brownian transition density are used to suggest an exponential family of distributions, which is analogous to the von Mises-Fisher spherical distribution and which has already been studied by J. K. Jensen. The computer algebra implementationItovsn3(W. S. Kendall) of stochastic calculus is used to perform the calculations (some of which actually date back to work by Dyson on eigenvalues of random matrices and by Dynkin on Brownian motion on ellipsoids). An interesting feature of these calculations is that they include the first application (to the author's knowledge) of the Gröbner basis algorithm in a stochastic calculus context.
On a random variable related to a system of convex bodies in the Euclidean space En
Authors: Stoka Marius
Published: April 2003

Let us consider, in the Euclidean space En, a fixed n-dimensional convex body K0 of volume V0 and a system K1,…,Km of mn-dimensional convex bodies, congruent to a convex set K. Assume that the sets Ki (i = 1,…,m) have random positions, being stochastically independent and uniformly distributed on a limited domain of En and denote by Vm the volume of the convex body Km = K0 ∩ (K1 ∩ … ∩ Km). The aim of this paper is the evaluation of the second moment of the random variable Vm.
On the current enhancement at the edge of a crack in a lattice of resistors
Authors: Taylor Howard M. , Sweitzer Dennis E.
Published: April 2003

Consider a network whose nodes are the integer lattice points and whose arcs are fuses of 1Ω resistance. Remove a horizontal segment ofNadjacent vertical arcs, forming a ‘crack’ of lengthN. Subject the network to a uniform potential gradient ofvvolts per arc in the north-south (or vertical) direction and measure the current in one of the two vertical arcs at the ends of the crack. We write this current in the forme(N)v, and calle(N) thecurrent enhancement.

We show that the enhancement grows at a rate that is the order of the square root of the crack length. Our method is to identify the enhancement with the mean time to exit an interval for a certain integer valued random walk, and then to use some of the well-known Fourier methods for studying random walk. Our random walk has no mean or higher moments and is in the domain of attraction of the Cauchy law. We provide a good approximation to the enhancement using the explicitly known mean time to exit an interval for a Cauchy process. Weak convergence arguments together with an estimate of a recurrence probability enable us to show that the current in an intact fuse, that is in the interior of a crack of lengthN, grows p roportionally withN/logN.