Smoothed Complexity Theory

Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and AvgP, respectively. While worst-case or average-case analysis give us a means to talk about the running time of a particular algorithm, complexity classes allows us to talk about the inherent difficulty of problems. Smoothed analysis is a hybrid of worst-case and average-case analysis and compensates some of their drawbacks. Despite its success for the analysis of single algorithms and problems, there is no embedding of smoothed analysis into computational complexity theory, which is necessary to classify problems according to their intrinsic difficulty. We propose a framework for smoothed complexity theory, define the relevant classes, and prove some first hardness results (of bounded halting and tiling) and tractability results (binary optimization problems, graph coloring, satisfiability). Furthermore, we discuss extensions and shortcomings of our model and relate it to semi-random models.Comment: to be presented at MFCS 201

Utilising family-based designs for detecting rare variant disease associations.

Rare genetic variants are thought to be important components in the causality of many diseases but discovering these associations is challenging. We demonstrate how best to use family-based designs to improve the power to detect rare variant disease associations. We show that using genetic data from enriched families (those pedigrees with greater than one affected member) increases the power and sensitivity of existing case-control rare variant tests. However, we show that transmission- (or within-family-) based tests do not benefit from this enrichment. This means that, in studies where a limited amount of genotyping is available, choosing a single case from each of many pedigrees has greater power than selecting multiple cases from fewer pedigrees. Finally, we show how a pseudo-case-control design allows a greater range of statistical tests to be applied to family data

Commensurate-incommensurate transitions of quantum Hall stripe states in double-quantum-well systems

In higher Landau levels (N>0) and around filling factors nu =4N+1, a two-dimensional electron gas in a double-quantum-well system supports a stripe groundstate in which the electron density in each well is spatially modulated. When a parallel magnetic field is added in the plane of the wells, tunneling between the wells acts as a spatially rotating effective Zeeman field coupled to the ``pseudospins'' describing the well index of the electron states. For small parallel fields, these pseudospins follow this rotation, but at larger fields they do not, and a commensurate-incommensurate transition results. Working in the Hartree-Fock approximation, we show that the combination of stripes and commensuration in this system leads to a very rich phase diagram. The parallel magnetic field is responsible for oscillations in the tunneling matrix element that induce a complex sequence of transitions between commensurate and incommensurate liquid or stripe states. The homogeneous and stripe states we find can be distinguished by their collective excitations and tunneling I-V, which we compute within the time-dependent Hartree-Fock approximation.Comment: 23 pages including 8 eps figure

Spin Transition in Strongly Correlated Bilayer Two Dimensional Electron Systems

Using a combination of heat pulse and nuclear magnetic resonance techniques we demonstrate that the phase boundary separating the interlayer phase coherent quantum Hall effect at $\nu_T = 1$ in bilayer electron gases from the weakly coupled compressible phase depends upon the spin polarization of the nuclei in the host semiconductor crystal. Our results strongly suggest that, contrary to the usual assumption, the transition is attended by a change in the electronic spin polarization.Comment: 4 pages, 3 postscript figur

Grover's algorithm on a Feynman computer

We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a single, time-independent Hamiltonian. We examine issues of locality and resource usage in implementing such a Hamiltonian. In the familiar language of Heisenberg spin-spin coupling, the clocking mechanism appears as an excitation of a basically linear chain of spins, with occasional controlled jumps that allow for motion on a planar graph: in this sense our model implements the idea of "timing" a quantum algorithm using a continuous-time random walk. In this context we examine some consequences of the entanglement between the states of the input/output register and the states of the quantum clock

Genospecies diversity of Lyme disease spirochetes in rodent reservoirs.

To determine whether particular Borrelia burgdorferi s.l. genospecies associate solely with rodent reservoir hosts, we compared the genospecies prevalence in questing nymphal Ixodes ticks with that in xenodiagnostic ticks that had fed as larvae on rodents captured in the same site. No genospecies was more prevalent in rodent-fed ticks than in questing ticks. The three main spirochete genospecies, therefore, share common rodent hosts