Search

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

In this note we re-examine the analysis of the paper "On the martingale property of stochastic exponentials" by B. Wong and C.C. Heyde, Journal of Applied Probability, 41(3):654-664, 2004. Some counterexamples are presented and alternative formulations are discussed., Comment: To appear in Journal of Applied Probability, 11 pages

AbsrtactStaring form a probability σ on the half-line moments of any order A. G. Pakes has defined probabilities σr, by length biasing order r and gr, by the stationary-excess operation of order r, r = 1, 2,…Examples are given to show that σ can bt determined in the Stieltjes sence while σ1 and g1 are indeterminate in the Stieltjes sence. This shows that a statement in a recent paper by Pakes does not hold.

The concept of a metaplectic form was introduced about 40 years ago by T. Kubota. He showed how Jacobi-Legendre symbols of arbitrary order give rise to characters of arithmetic groups. Metaplectic forms are the automorphic forms with these characters. Kubota also showed how higher analogues of the classical theta functions could be constructed using Selberg's theory of Eisenstein series. Unfortunately many aspects of these generalized theta series are still unknown, for example, their Fourier coefficients. The analogues in the case of function fields over finite fields can in principle be calculated explicitly and this was done first by J. Hoffstein in the case of a rational function field. Here we shall return to his calculations and clarify a number of aspects of them, some of which are important for recent developments.

This paper discusses the stationarity conditions proposed by M. Yang (2000, Econometric Theory 16, 23–43), in the framework of Markov-switching first-order autoregressions. A weaker second-order stationarity assumption is proposed.

This paper presents a sufficient condition for a one-dimensional Dirac operator with a potential tending to infinity at infinity to have no eigenvalues. It also provides a quick proof (and suggests variations) of a related criterion given by Evans and Harris.

In the present paper we give a short proof of a result of Zaks, Frostig and Levikson [2006] on the solution of an optimization problem which is related to the problem of optimal pricing of a heterogeneous portfolio. Following Zaks, Frostig and Levikson [2006], we consider a heterogeneous portfolio which is composed by k risk classes such that for each j ! {1, …, k} the risk class j contains nj risks Xj,1 ,… ,Xj,nj which are assumed to be i.i.d. with finite first and second moments and non-zero variance. Then the total risk of risk class j is defined as

This note discusses the concept of aliasing and its use in the paper by H.J. Bierens (2001, Econometric Theory 17, 962–983), in the framework of a second-order autoregression with complex unit roots. The condition on the range of the angular frequency I† is extended to I† ∈ (0,2I€) − {I€}.Financial support from UPV-EHU research project 9/UPV-00038.321-13503/2001, Basque Government project PI9970 and Ministerio de ciencia y tecnologA­a BEC2003-02028 is gratefully acknowledged.

It is shown that an immersion of n dimensional compact oriented manifold without boundary into the n+1 dimensional Euclidean space, hyperbolic space or open half sphere is a totally umbilic immersion if one of the mean curvature function H_l does not vanish and the ratio H_k/H_l is constant, 1\leq k, l \leq n, k\ne l.

Recently, Saleh claimed to have solved `a long standing open question' in Topology; namely, he proved that every almost continuous function is closure continuous (= $\theta$-continuous). Unfortunately, this problem was settled long time ago and even a better result is known., Comment: 2 pages, to appear in "Glasgow Math. J."

Peter Morriss's attack on R. J. Johnston's Note takes some side-swipes at us. We are allegedly ‘not quite up to par’, because (i) we are said to advocate the Banzhaf index; (ii) we are accused of ignoring a simpler route to our conclusion.

The mechanical procedure of paper folding generates an uncountable family of infinite sequences of fold patterns. We obtain the associated Fourier series and show that the sequences are almost periodic and hence deterministic. Further, we show that paper folding numbers defined by the sequences are all transcendental.

Consider the first order differential equation (1) , where pi, and τi, for i = 1,…,n, are positive constants. To find necessary and sufficient conditions, in terms of the coefficients and the delays only, under which all solutions of (1) oscillate, is a problem of great importence. In a recent paper, Bowcock and Yu claimed that is a necessary and sufficient condition for all solutions of (1) to be oscillatory. In this paper a counterexample shows that the above result is not valid and the error in this paper is indicated.

In [5] Doeblin considered some classes of finite non-homogeneous Markov chains and gave without proofs several results concerning their asymptotic behaviour. In the present paper we first attempt to make Doeblin's results precise and try to reconstruct his arguments. Subsequently we investigate more general situations, where a state space decomposition is provided by the sets occurring in the representation of the atomic sets of the tail or-field. We show that Doeblin's notion of an associated chain, as well as considerations regarding the tail ar-field structure of the chain, can be used to solve such cases. FINITE MARKOV CHAIN; FINAL CLASS; CYCLICALLY MOVING SUBCLASS; TAIL ar-FIELD; ATOMIC SET; RECURRENCE; WHIRLPOOL

We illustrate a technique for computing certain integrals that arise in probability theory by giving a new derivation of a formula of Kingman. This formula contains the joint distribution of the processes F(t) = inf {s: X(t + s) = b} and B(t) = inf{s: X(t - s) = b} where X is a time homogeneous, continuous parameter, Markov process and b is a fixed point in its state space. We then extend this formula to the situation in which b is replaced by a finite set {b 1, …, b n }.

‘Bell's Theorem’ is the collective name for a family of arguments, which more accurately should be referred to as ‘Theorems of Bell's Type’, all being variants of the remarkable argument given by J. S. Bell (1964). All of these arguments have the format E & H → I, where E is a description of a type of experimental setup involving pairs of particles emitted from a common source, H is a physical hypothesis which typically expresses some version of “realism” and some version of “locality”, and I is an inequality concerning correlations between particles of a pair. There are differences among theorems of Bell's type regarding the details of the inequality I , which are important in actually carrying out experimental tests. There are differences regarding the arrow—i.e., the procedure whereby I is inferred from E & H.

The utilisation factor for a discrete dam, defined as the stationary probability of non-emptiness of the dam just before release, is obtained for a class of models that includes the Odoom–Lloyd model, the Anis–Lloyd model, the model of Herbert, etc. The method used points to a different approach to measuring dam utilisation via the actual utilisation, which appears to be more fruitful, and this is discussed in the last section.

Let X be a locally compact and σ-compact abelian group and let denote the dual group of X. We denote by ξ a fixed Haar measure on X and by the Haar measure associated with ξ. In [2], we show the followingTheorem. Let (αt)t≧0 be a sub-Markov convolution semi-group on X and let ψ be the negative definite function associated with (αt)t≧0. Then (αt)t≧0 is transient if and only if Re (1/ψ) is locally -summable.

It is shown that a result by Moeckel holds not only for admissible subgroups of SL (2, ℤ), but also for arbitrary subgroups of finite index.

It was brought to our attention by M. Fitting that Beth's semantic tableau system using the intuitionistic propositional rules and the classical quantifier rules produces a correct but incomplete axiomatization of the logic CD of constant domains. The formulawhere T is a truth constant, being an instance of a formula which is valid in all Kripke models with constant domains but which is not provable without cut.From the Fitting formula one can immediately obtain that the sequentalthough provable in the system GD outlined in [3], does not have a cut-free proof (in the system GD).If the only problem with GD were the sequent S0, then we could extend GD to the system GD+ by adding the following (correct) rule:Since the new rule still satisfies the subformula property a cut elimination theorem for GD+ would be a step in the right direction for a syntactical proof for the interpolation theorem for the logic of constant domains (cf. Gabbay [2]; see also §4). Unfortunately, one can show that the sequentwhere P is a propositional parameter (or formula without x free) has a derivation in GD+, but does not have a cut-free derivation (in GD+). Of course, we could extend GD+ to GD++ by adding the following correct (and with the subformula property) rule:But then we can find a sequent S2 which, although provable with cut in GD++, does not have a cut-free derivation in GD++.

Two sums given by J. B. Miller are evaluated in terms of classical hypergeometric results.

Applying a new and very elegant method of proof of the Schur-Hardy inequality, given by E.R. Love at the Oberwolfach conference on Linear Spaces and Approximation (1977), norm estimates of integral operators with homogeneous kernels are established in the setting of abstract function norms. Applications to Flett's inequality, to integral means, and to fractional integrals are given.

A well known observation of Lov\'asz is that if a hypergraph is not $2$-colorable, then at least one pair of its edges intersect at a single vertex. %This very simple criterion turned out to be extremly useful . In this short paper we consider the quantitative version of Lov\'asz's criterion. That is, we ask how many pairs of edges intersecting at a single vertex, should belong to a non $2$-colorable $n$-uniform hypergraph? Our main result is an {\em exact} answer to this question, which further characterizes all the extremal hypergraphs. The proof combines Bollob\'as's two families theorem with Pluhar's randomized coloring algorithm., Comment: A note on Property B

In this paper, the questions about bitopological spaces proposed by S. Lal are solved and one of his counterexamples rectified.

Throughout, (X, ≤ ) denotes a partially ordered set (p. o. set), where X is assumed to be finite. A subset Y of X is called a k-union if Y contains no chain of length K + 1. In particular, therefore, a 1-union is just an antichain; and it is readily seen that Y is a k-union if and only if it is a union of K antichains. (Dually, a subset Z of X is a k-counion if Z contains no antichain of length k + 1.) We denote by dk (X) the maximum cardinality of a k-union in X, with a similar notation for other p. o. sets. Now let be any partition of X into chains, and write.

An elementary proof is given of a result obtained by concerning the sum of an infinite series involving a 4F3.

Objective:To conduct nutrition-related analyses on large-scale health surveys, two aspects of the survey must be incorporated into the analysis: the sampling weights and the sample design; a practice which is not always observed. The present paper compares three analyses: (1) unweighted; (2) weighted but not accounting for the complex sample design; and (3) weighted and accounting for the complex design using replicate weights.Design:Descriptive statistics are computed and a logistic regression investigation of being overweight/obese is conducted using Stata.Setting:Cross-sectional health survey with complex sample design where replicate weights are supplied rather than the variables containing sample design information.Participants:Responding adults from the National Nutrition and Physical Activity Survey (NNPAS) part of the Australian Health Survey (2011–2013).Results:Unweighted analysis produces biased estimates and incorrect estimates of se. Adjusting for the sampling weights gives unbiased estimates but incorrect se estimates. Incorporating both the sampling weights and the sample design results in unbiased estimates and the correct se estimates. This can affect interpretation; for example, the incorrect estimate of the OR for being a current smoker in the unweighted analysis was 1·20 (95 % CI 1·06, 1·37), t= 2·89, P = 0·004, suggesting a statistically significant relationship with being overweight/obese. When the sampling weights and complex sample design are correctly incorporated, the results are no longer statistically significant: OR = 1·06 (95 % CI 0·89, 1·27), t = 0·71, P = 0·480.Conclusions:Correct incorporation of the sampling weights and sample design is crucial for valid inference from survey data.