Stability and photochemistry of ClO dimers formed at low temperature in the gas phase

The recent observations of elevated concentrations of the ClO radical in the austral spring over Antarctica have implicated catalytic destruction by chlorine in the large depletions seen in the total ozone column. One of the chemical theories consistent with an elevated concentration of the ClO is a cycle involving the formation of the ClO dimer through the association reaction: ClO + ClO = Cl2O2 and the photolysis of the dimer to give the active Cl species necessary for O3 depletion. Here, researchers report experimental studies designed to characterize the dimer of ClO formed by the association reaction at low temperatures. ClO was produced by static photolysis of several different precursor systems: Cl sub 2 + O sub 3; Cl sub 2 O sub 2; OClO + Cl sub 2 O spectroscopy in the U.V. region, which allowed the time dependence of Cl sub 2, Cl sub 2 O, ClO, OClO, O sub 3 and other absorbing molecules to be determined

A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits

In this paper we study the complexity of constructing a hitting set for the closure of VP, the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the real or complex numbers. Specifically, we show that there is a PSPACE algorithm that given n,s,r in unary outputs a set of n-tuples over the rationals of size poly(n,s,r), with poly(n,s,r) bit complexity, that hits all n-variate polynomials of degree-r that are the limit of size-s algebraic circuits. Previously it was known that a random set of this size is a hitting set, but a construction that is certified to work was only known in EXPSPACE (or EXPH assuming the generalized Riemann hypothesis). As a corollary we get that a host of other algebraic problems such as Noether Normalization Lemma, can also be solved in PSPACE deterministically, where earlier only randomized algorithms and EXPSPACE algorithms (or EXPH assuming the generalized Riemann hypothesis) were known. The proof relies on the new notion of a robust hitting set which is a set of inputs such that any nonzero polynomial that can be computed by a polynomial size algebraic circuit, evaluates to a not too small value on at least one element of the set. Proving the existence of such a robust hitting set is the main technical difficulty in the proof. Our proof uses anti-concentration results for polynomials, basic tools from algebraic geometry and the existential theory of the reals

Parrondo-like behavior in continuous-time random walks with memory

The Continuous-Time Random Walk (CTRW) formalism can be adapted to encompass stochastic processes with memory. In this article we will show how the random combination of two different unbiased CTRWs can give raise to a process with clear drift, if one of them is a CTRW with memory. If one identifies the other one as noise, the effect can be thought as a kind of stochastic resonance. The ultimate origin of this phenomenon is the same of the Parrondo's paradox in game theoryComment: 8 pages, 3 figures, revtex; enlarged and revised versio

Adaptation Reduces Variability of the Neuronal Population Code

Sequences of events in noise-driven excitable systems with slow variables often show serial correlations among their intervals of events. Here, we employ a master equation for general non-renewal processes to calculate the interval and count statistics of superimposed processes governed by a slow adaptation variable. For an ensemble of spike-frequency adapting neurons this results in the regularization of the population activity and an enhanced post-synaptic signal decoding. We confirm our theoretical results in a population of cortical neurons.Comment: 4 pages, 2 figure

Scanning tunneling microscopy and kinetic Monte Carlo investigation of Cesium superlattices on Ag(111)

Cesium adsorption structures on Ag(111) were characterized in a low-temperature scanning tunneling microscopy experiment. At low coverages, atomic resolution of individual Cs atoms is occasionally suppressed in regions of an otherwise hexagonally ordered adsorbate film on terraces. Close to step edges Cs atoms appear as elongated protrusions along the step edge direction. At higher coverages, Cs superstructures with atomically resolved hexagonal lattices are observed. Kinetic Monte Carlo simulations model the observed adsorbate structures on a qualitative level.Comment: 8 pages, 7 figure

Simulating non-Markovian stochastic processes

We present a simple and general framework to simulate statistically correct realizations of a system of non-Markovian discrete stochastic processes. We give the exact analytical solution and a practical an efficient algorithm alike the Gillespie algorithm for Markovian processes, with the difference that now the occurrence rates of the events depend on the time elapsed since the event last took place. We use our non-Markovian generalized Gillespie stochastic simulation methodology to investigate the effects of non-exponential inter-event time distributions in the susceptible-infected-susceptible model of epidemic spreading. Strikingly, our results unveil the drastic effects that very subtle differences in the modeling of non-Markovian processes have on the global behavior of complex systems, with important implications for their understanding and prediction. We also assess our generalized Gillespie algorithm on a system of biochemical reactions with time delays. As compared to other existing methods, we find that the generalized Gillespie algorithm is the most general as it can be implemented very easily in cases, like for delays coupled to the evolution of the system, where other algorithms do not work or need adapted versions, less efficient in computational terms.Comment: Improvement of the algorithm, new results, and a major reorganization of the paper thanks to our coauthors L. Lafuerza and R. Tora

Small Energy Scale for Mixed-Valent Uranium Materials

We investigate a two-channel Anderson impurity model with a $5f^1$ magnetic and a $5f^2$ quadrupolar ground doublet, and a $5f^2$ excited triplet. Using the numerical renormalization group method, we find a crossover to a non-Fermi liquid state below a temperature $T^*$ varying as the $5f^2$ triplet-doublet splitting to the 7/2 power. To within numerical accuracy, the non-linear magnetic susceptibility and the $5f^1$ contribution to the linear susceptibility are given by universal one-parameter scaling functions. These results may explain UBe$_{13}$ as mixed valent with a small crossover scale $T^*$.Comment: 4 pages, 3 figures, REVTeX, to appear in Phys. Rev. Let

Voter model with non-Poissonian interevent intervals

Recent analysis of social communications among humans has revealed that the interval between interactions for a pair of individuals and for an individual often follows a long-tail distribution. We investigate the effect of such a non-Poissonian nature of human behavior on dynamics of opinion formation. We use a variant of the voter model and numerically compare the time to consensus of all the voters with different distributions of interevent intervals and different networks. Compared with the exponential distribution of interevent intervals (i.e., the standard voter model), the power-law distribution of interevent intervals slows down consensus on the ring. This is because of the memory effect; in the power-law case, the expected time until the next update event on a link is large if the link has not had an update event for a long time. On the complete graph, the consensus time in the power-law case is close to that in the exponential case. Regular graphs bridge these two results such that the slowing down of the consensus in the power-law case as compared to the exponential case is less pronounced as the degree increases.Comment: 18 pages, 8 figure

Measuring Polynomial Invariants of Multi-Party Quantum States

We present networks for directly estimating the polynomial invariants of multi-party quantum states under local transformations. The structure of these networks is closely related to the structure of the invariants themselves and this lends a physical interpretation to these otherwise abstract mathematical quantities. Specifically, our networks estimate the invariants under local unitary (LU) transformations and under stochastic local operations and classical communication (SLOCC). Our networks can estimate the LU invariants for multi-party states, where each party can have a Hilbert space of arbitrary dimension and the SLOCC invariants for multi-qubit states. We analyze the statistical efficiency of our networks compared to methods based on estimating the state coefficients and calculating the invariants.Comment: 8 pages, 4 figures, RevTex4, v2 references update

Elliptic aspects of statistical mechanics on spheres

Our earlier results on the temperature inversion properties and the ellipticisation of the finite temperature internal energy on odd spheres are extended to orbifold factors of odd spheres and then to other thermodynamic quantities, in particular to the specific heat. The behaviour under modular transformations is facilitated by the introduction of a modular covariant derivative and it is shown that the specific heat on any odd sphere can be expressed in terms of just three functions. It is also shown that the free energy on the circle can be written elliptically.Comment: 22 pages. JyTe