Most distribution free nonparametric methods depend on the ranks or orderings of the individual observations. This dissertation develops methods for the situation when there is only partial information about the ranks available. A random-linear-extension exact test and an empirical version of the random-linear-extension test are proposed as a new way to compare groups of data with partial orders. The basic computation procedure is to generate all possible permutations constrained by the known partial order using a randomization method similar in nature to multiple imputation. This random-linear-extension test can be simply implemented using a Gibbs Sampler to generate a random sample of complete orderings. Given a complete ordering, standard nonparametric methods, such as the Wilcoxon rank-sum test, can be applied, and the corresponding test statistics and rejection regions can be calculated. As a direct result of our new method, a single p-value is replaced by a distribution of p-values. This is related to some recent work on Fuzzy P-values, which was introduced by Geyer and Meeden in Statistical Science in 2005. A special case is to compare two groups when only two objects can be compared at a time. Three matching schemes, random matching, ordered matching and reverse matching are introduced and compared between each other. The results described in this dissertation provide some surprising insights into the statistical information in partial orderings. / Statistics

Yes / A quantum system (n) with variables in Z(n), where n = Qpi (with pi prime numbers), is considered. The non-near-linear geometry G(n) of the phase space Z(n) × Z(n), is studied. The lines through the origin are factorized in terms of ‘prime factor lines’ in Z(pi)×Z(pi). Weak mutually unbiased bases (WMUB) which are products of the mutually unbiased bases in the ‘prime factor Hilbert spaces’ H(pi), are also considered. The factorization of both lines and WMUB is analogous to the factorization of integers in terms of prime numbers. The duality between lines and WMUB is discussed. It is shown that there is a partial order in the set of subgeometries of G(n), isomorphic to the partial order in the set of subsystems of (n).

We formalize and analyze the notions of monotonicity and complete monotonicity for Markov Chains in continuous-time, taking values in a finite partially ordered set. Similarly to what happens in discrete-time, the two notions are not equivalent. However, we show that there are partially ordered sets for which monotonicity and complete monotonicity coincide in continuoustime but not in discrete-time.

No description available.