Statistics sunspots and settlement: Influences on sum of probability curves

Large data sets of radiocarbon dates are becoming a more common feature of archaeological research. The sheer numbers of radiocarbon dates produced, however, raise issues of representation and interpretation. This paper presents a methodology which both reduces the visible impact of dating fluctuations, but also takes into consideration the influence of the underlying radiocarbon calibration curve. By doing so, it may be possible to distinguish between periods of human activity in early medieval Ireland and the statistical tails produced by radiocarbon calibration.

Making heads or tails of probability:an experiment with random generators

The equiprobability bias is a tendency for individuals to think of probabilistic events as 'equiprobable' by nature, and to judge outcomes that occur with different probabilities as equally likely. The equiprobability bias has been repeatedly found to be related to formal education in statistics, and it is claimed to be based on a misunderstanding of the concept of randomness.

Dense spectrum of resonances and spin-1/2 particle capture in a near-black-hole metric

We show that a spin-1/2 particle in the gravitational field of a massive body of radius R which slightly exceeds the Schwarzschild radius rs, possesses a dense spectrum of narrow resonances. Their lifetimes and density tend to infinity in the limit R → rs. We determine the cross section of the particle capture into these resonances and show that it is equal to the spin-1/2 absorption cross section for a Schwarzschild black hole. Thus black-hole properties may emerge in a non-singular static metric prior to the formation of a black hole.

Kuznetsov independence for interval-valued expectations and sets of probability distributions: Properties and algorithms

Kuznetsov independence of variables X and Y means that, for any pair of bounded functions f(X) and g(Y), E[f(X)g(Y)]=E[f(X)] *times* E[g(Y)], where E[.] denotes interval-valued expectation and *times* denotes interval multiplication. We present properties of Kuznetsov independence for several variables, and connect it with other concepts of independence in the literature; in particular we show that strong extensions are always included in sets of probability distributions whose lower and upper expectations satisfy Kuznetsov independence. We introduce an algorithm that computes lower expectations subject to judgments of Kuznetsov independence by mixing column generation techniques with nonlinear programming. Finally, we define a concept of conditional Kuznetsov independence, and study its graphoid properties.