The weak pigeonhole principle for function classes in S^1_2

It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S^1_2 for provably weaker function classes.Comment: 11 page

Quasi-stationary distributions for reducible absorbing Markov chains in discrete time

We consider discrete-time Markov chains with one coffin state and a finite set $S$ of transient states, and are interested in the limiting behaviour of such a chain as time $n \to \infty,$ conditional on survival up to $n$. It is known that, when $S$ is irreducible, the limiting conditional distribution of the chain equals the (unique) quasi-stationary distribution of the chain, while the latter is the (unique) $\rho$-invariant distribution for the one-step transition probability matrix of the (sub)Markov chain on $S,$ $\rho$ being the Perron-Frobenius eigenvalue of this matrix. Addressing similar issues in a setting in which $S$ may be reducible, we identify all quasi-stationary distributions and obtain a necessary and sufficient condition for one of them to be the unique $\rho$-invariant distribution. We also reveal conditions under which the limiting conditional distribution equals the $\rho$-invariant distribution if it is unique. We conclude with some examples

On the Complexity of Quantum ACC

For any $q > 1$, let \MOD_q be a quantum gate that determines if the number of 1's in the input is divisible by $q$. We show that for any $q,t > 1$, \MOD_q is equivalent to \MOD_t (up to constant depth). Based on the case $q=2$, Moore \cite{moore99} has shown that quantum analogs of AC$^{(0)}$, ACC$[q]$, and ACC, denoted QAC$^{(0)}_{wf}$, QACC$[2]$, QACC respectively, define the same class of operators, leaving $q > 2$ as an open question. Our result resolves this question, proving that QAC$^{(0)}_{wf} =$ QACC$[q] =$ QACC for all $q$. We also develop techniques for proving upper bounds for QACC in terms of related language classes. We define classes of languages EQACC, NQACC and BQACC_{\rats}. We define a notion $\log$-planar QACC operators and show the appropriately restricted versions of EQACC and NQACC are contained in P/poly. We also define a notion of $\log$-gate restricted QACC operators and show the appropriately restricted versions of EQACC and NQACC are contained in TC$^{(0)}$. To do this last proof, we show that TC$^{(0)}$ can perform iterated addition and multiplication in certain field extensions. We also introduce the notion of a polynomial-size tensor graph and show that families of such graphs can encode the amplitudes resulting from apply an arbitrary QACC operator to an initial state.Comment: 22 pages, 4 figures This version will appear in the July 2000 Computational Complexity conference. Section 4 has been significantly revised and many typos correcte

Limiting the spread of disease through altered migration patterns

We consider a model for an epidemic in a population that occupies geographically distinct locations. The disease is spread within subpopulations by contacts between infective and susceptible individuals, and is spread between subpopulations by the migration of infected individuals. We show how susceptible individuals can act collectively to limit the spread of disease during the initial phase of an epidemic, by specifying the distribution that minimises the growth rate of the epidemic when the infectives are migrating so as to maximise the growth rate. We also give an explicit strategy that minimises the basic reproduction number, which is also shown be optimal in terms of the probability of extinction and total size of the epidemic

A metapopulation model with Markovian landscape dynamics

We study a variant of Hanski's incidence function model that allows habitat patch characteristics to vary over time following a Markov process. The widely studied case where patches are classified as either suitable or unsuitable is included as a special case. For large metapopulations, we determine a recursion for the probability that a given habitat patch is occupied. This recursion enables us to clarify the role of landscape dynamics in the survival of a metapopulation. In particular, we show that landscape dynamics affects the persistence and equilibrium level of the metapopulation primarily through its effect on the distribution of a local population's life span.Comment: This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0

First passage time density for the Ehrenfest model

We derive an explicit expression for the probability density of the first passage time to state 0 for the Ehrenfest diffusion model in continuous time

Limiting conditional distributions for birth-death processes

In a recent paper one of us identified all of the quasi-stationary distributions for a non-explosive, evanescent birth-death process for which absorption is certain, and established conditions for the existence of the corresponding limiting conditional distributions. Our purpose is to extend these results in a number of directions. We shall consider separately two cases depending on whether or not the process is evanescent. In the former case we shall relax the condition that absorption is certain. Furthermore, we shall allow for the possibility that the minimal process might be explosive, so that the transition rates alone will not necessarily determine the birth-death process uniquely. Although we shall be concerned mainly with the minimal process, our most general results hold for any birth-death process whose transition probabilities satisfy both the backward and the forward Kolmogorov differential equations

Quasi-stationary distributions

This paper contains a survey of results related to quasi-stationary distributions, which arise in the setting of stochastic dynamical systems that eventually evanesce, and which may be useful in describing the long-term behaviour of such systems before evanescence. We are concerned mainly with continuous-time Markov chains over a finite or countably infinite state space, since these processes most often arise in applications, but will make reference to results for other processes where appropriate. Next to giving an historical account of the subject, we review the most important results on the existence and identification of quasi-stationary distributions for general Markov chains, and give special attention to birth-death processes and related models. Results on the question of whether a quasi-stationary distribution, given its existence, is indeed a good descriptor of the long-term behaviour of a system before evanescence, are reviewed as well. The paper is concluded with a summary of recent developments in numerical and approximation methods