Star factorizations of graph products

A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.

Natural selection and quantitative genetics of life-history traits in Western women: A twin study

Whether contemporary human populations are still evolving as a result of natural selection has been hotly debated. For natural selection to cause evolutionary change in a trait, variation in the trait must be correlated with fitness and be genetically heritable and there must be no genetic constraints to evolution. These conditions have rarely been tested in human populations. In this study, data from a large twin cohort were used to assess whether selection Will cause a change among women in contemporary Western population for three life-history traits: age at menarche, age at first reproduction, and age at menopause. We control for temporal variation in fecundity (the baby boom phenomenon) and differences between women in educational background and religious affiliation. University-educated women have 35% lower fitness than those with less than seven years education, and Roman Catholic women have about 20% higher fitness than those of other religions. Although these differences were significant, education and religion only accounted for 2% and 1% of variance in fitness, respectively. Using structural equation modeling, we reveal significant genetic influences for all three life-history traits, with heritability estimates of 0.50, 0.23, and 0.45, respectively. However, strong genetic covariation with reproductive fitness could only be demonstrated for age at first reproduction, with much weaker covariation for age at menopause and no significant covariation for age at menarche. Selection may, therefore, lead to the evolution of earlier age at first reproduction in this population. We also estimate substantial heritable variation in fitness itself, with approximately 39% of the variance attributable to additive genetic effects, the remainder consisting of unique environmental effects and small effects from education and religion. We discuss mechanisms that could be maintaining such a high heritability for fitness. Most likely is that selection is now acting on different traits from which it did in pre-industrial human populations.

Optimal patch-leaving behaviour: a case study using the parasitoid Cotesia rubecular

1. Parasitoids are predicted to spend longer in patches with more hosts, but previous work on Cotesia rubecula (Marshall) has not upheld this prediction, Tests of theoretical predictions may be affected by the definition of patch leaving behaviour, which is often ambiguous. 2. In this study whole plants were considered as patches and assumed that wasps move within patches by means of walking or flying. Within-patch and between-patch flights were distinguished based on flight distance. The quality of this classification was tested statistically by examination of log-survivor curves of flight times. 3. Wasps remained longer in patches with higher host densities, which is consistent with predictions of the marginal value theorem (Charnov 1976). tinder the assumption that each flight indicates a patch departure, there is no relationship between host density and leaving tendency. 4. Oviposition influences the patch leaving behaviour of wasps in a count down fashion (Driessen et al. 1995), as predicted by an optimal foraging model (Tenhumberg, Keller & Possingham 2001). 5. Wasps spend significantly longer in the first patch encountered following release, resulting in an increased rate of superparasitism.

Estimating economic relationships subject to firm- and time-varying equality and inequality constraints

Applied econometricians often fail to impose economic regularity constraints in the exact form economic theory prescribes. We show how the Singular Value Decomposition (SVD) Theorem and Markov Chain Monte Carlo (MCMC) methods can be used to rigorously impose time- and firm-varying equality and inequality constraints. To illustrate the technique we estimate a system of translog input demand functions subject to all the constraints implied by economic theory, including observation-varying symmetry and concavity constraints. Results are presented in the form of characteristics of the estimated posterior distributions of functions of the parameters. Copyright (C) 2001 John Wiley Sons, Ltd.

Existence of a semicontinuous or continuous utility function: a unified approach and an elementary proof

In this paper, we present a new unified approach and an elementary proof of a very general theorem on the existence of a semicontinuous or continuous utility function representing a preference relation. A simple and interesting new proof of the famous Debreu Gap Lemma is given. In addition, we prove a new Gap Lemma for the rational numbers and derive some consequences. We also prove a theorem which characterizes the existence of upper semicontinuous utility functions on a preordered topological space which need not be second countable. This is a generalization of the classical theorem of Rader which only gives sufficient conditions for the existence of an upper semicontinuous utility function for second countable topological spaces. (C) 2002 Elsevier Science B.V. All rights reserved.

The non-existence of a utility function and the structure of non-representable preference relations

In this paper we investigate the structure of non-representable preference relations. While there is a vast literature on different kinds of preference relations that can be represented by a real-valued utility function, very little is known or understood about preference relations that cannot be represented by a real-valued utility function. There has been no systematic analysis of the non-representation problem. In this paper we give a complete description of non-representable preference relations which are total preorders or chains. We introduce and study the properties of four classes of non-representable chains: long chains, planar chains, Aronszajn-like chains and Souslin chains. In the main theorem of the paper we prove that a chain is non-representable if and only it is a long chain, a planar chain, an Aronszajn-like chain or a Souslin chain. (C) 2002 Published by Elsevier Science B.V.

Lower Bounds on the State Complexity of Geometric Goppa Codes

We reinterpret the state space dimension equations for geometric Goppa codes. An easy consequence is that if deg G less than or equal to n-2/2 or deg G greater than or equal to n-2/2 + 2g then the state complexity of C-L(D, G) is equal to the Wolf bound. For deg G is an element of [n-1/2, n-3/2 + 2g], we use Clifford's theorem to give a simple lower bound on the state complexity of C-L(D, G). We then derive two further lower bounds on the state space dimensions of C-L(D, G) in terms of the gonality sequence of F/F-q. (The gonality sequence is known for many of the function fields of interest for defining geometric Goppa codes.) One of the gonality bounds uses previous results on the generalised weight hierarchy of C-L(D, G) and one follows in a straightforward way from first principles; often they are equal. For Hermitian codes both gonality bounds are equal to the DLP lower bound on state space dimensions. We conclude by using these results to calculate the DLP lower bound on state complexity for Hermitian codes.

Model specification tests in nonparametric stochastic regression models

In this paper, we consider testing for additivity in a class of nonparametric stochastic regression models. Two test statistics are constructed and their asymptotic distributions are established. We also conduct a small sample study for one of the test statistics through a simulated example. (C) 2002 Elsevier Science (USA).

Simple operational interpretation of the fidelity of mixed states

This Brief Report presents a corollary to Uhlmann's theorem which provides a simple operational interpretation of the fidelity of mixed states.

Predictor-corrector methods of Runge-Kutta type for stochastic differential equations

In this paper we construct predictor-corrector (PC) methods based on the trivial predictor and stochastic implicit Runge-Kutta (RK) correctors for solving stochastic differential equations. Using the colored rooted tree theory and stochastic B-series, the order condition theorem is derived for constructing stochastic RK methods based on PC implementations. We also present detailed order conditions of the PC methods using stochastic implicit RK correctors with strong global order 1.0 and 1.5. A two-stage implicit RK method with strong global order 1.0 and a four-stage implicit RK method with strong global order 1.5 used as the correctors are constructed in this paper. The mean-square stability properties and numerical results of the PC methods based on these two implicit RK correctors are reported.

A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.

Implicit vector equilibrium problems with applications

Let X and Y be Hausdorff topological vector spaces, K a nonempty, closed, and convex subset of X, C: K--> 2(Y) a point-to-set mapping such that for any x is an element of K, C(x) is a pointed, closed, and convex cone in Y and int C(x) not equal 0. Given a mapping g : K --> K and a vector valued bifunction f : K x K - Y, we consider the implicit vector equilibrium problem (IVEP) of finding x* is an element of K such that f (g(x*), y) is not an element of - int C(x) for all y is an element of K. This problem generalizes the (scalar) implicit equilibrium problem and implicit variational inequality problem. We propose the dual of the implicit vector equilibrium problem (DIVEP) and establish the equivalence between (IVEP) and (DIVEP) under certain assumptions. Also, we give characterizations of the set of solutions for (IVP) in case of nonmonotonicity, weak C-pseudomonotonicity, C-pseudomonotonicity, and strict C-pseudomonotonicity, respectively. Under these assumptions, we conclude that the sets of solutions are nonempty, closed, and convex. Finally, we give some applications of (IVEP) to vector variational inequality problems and vector optimization problems. (C) 2003 Elsevier Science Ltd. All rights reserved.

Stokes-operator-squeezed continuous-variable polarization states

We investigate nonclassical Stokes-operator variances in continuous-wave polarization-squeezed laser light generated from one and two optical parametric amplifiers. A general expression of how Stokes-operator variances decompose into two-mode quadrature operator variances is given. Stokes parameter variance spectra for four different polarization-squeezed states have been measured and compared with a coherent state. Our measurement results are visualized by three-dimensional Stokes-operator noise volumes mapped on the quantum Poincare sphere. We quantitatively compare the channel capacity of the different continuous-variable polarization states for communication protocols. It is shown that squeezed polarization states provide 33% higher channel capacities than the optimum coherent beam protocol.

Pseudo-randomness of round-off errors in discretized linear maps on the plane

We analyze the sequences of round-off errors of the orbits of a discretized planar rotation, from a probabilistic angle. It was shown [Bosio & Vivaldi, 2000] that for a dense set of parameters, the discretized map can be embedded into an expanding p-adic dynamical system, which serves as a source of deterministic randomness. For each parameter value, these systems can generate infinitely many distinct pseudo-random sequences over a finite alphabet, whose average period is conjectured to grow exponentially with the bit-length of the initial condition (the seed). We study some properties of these symbolic sequences, deriving a central limit theorem for the deviations between round-off and exact orbits, and obtain bounds concerning repetitions of words. We also explore some asymptotic problems computationally, verifying, among other things, that the occurrence of words of a given length is consistent with that of an abstract Bernoulli sequence.