How thick is a fault? Fault displacement-thickness scaling revisited

No abstract available

Freezing in random graph ferromagnets

Using T=0 Monte Carlo and simulated annealing simulation, we study the energy relaxation of ferromagnetic Ising and Potts models on random graphs. In addition to the expected exponential decay to a zero energy ground state, a range of connectivities for which there is power law relaxation and freezing to a metastable state is found. For some connectivities this freezing persists even using simulated annealing to find the ground state. The freezing is caused by dynamic frustration in the graphs, and is a feature of the local search-nature of the Monte Carlo dynamics used. The implications of the freezing on agent-based complex systems models are briefly considered.Comment: Published version: 1 reference deleted, 1 word added. 4 pages, 5 figure

Relaxation rates and collision integrals for Bose-Einstein condensates

Near equilibrium, the rate of relaxation to equilibrium and the transport properties of excitations (bogolons) in a dilute Bose-Einstein condensate (BEC) are determined by three collision integrals, $\mathcal{G}^{12}$, $\mathcal{G}^{22}$, and $\mathcal{G}^{31}$. All three collision integrals conserve momentum and energy during bogolon collisions, but only $\mathcal{G}^{22}$ conserves bogolon number. Previous works have considered the contribution of only two collision integrals, $\mathcal{G}^{22}$ and $\mathcal{G}^{12}$. In this work, we show that the third collision integral $\mathcal{G}^{31}$ makes a significant contribution to the bogolon number relaxation rate and needs to be retained when computing relaxation properties of the BEC. We provide values of relaxation rates in a form that can be applied to a variety of dilute Bose-Einstein condensates.Comment: 18 pages, 4 figures, accepted by Journal of Low Temperature Physics 7/201

Noise sensitivity of sub- and supercritically bifurcating patterns with group velocities close to the convective-absolute instability

The influence of small additive noise on structure formation near a forwards and near an inverted bifurcation as described by a cubic and quintic Ginzburg Landau amplitude equation, respectively, is studied numerically for group velocities in the vicinity of the convective-absolute instability where the deterministic front dynamics would empty the system.Comment: 16 pages, 7 Postscript figure

Simulations of neutron background in a time projection chamber relevant to dark matter searches

Presented here are results of simulations of neutron background performed for a time projection chamber acting as a particle dark matter detector in an underground laboratory. The investigated background includes neutrons from rock and detector components, generated via spontaneous fission and (alpha, n) reactions, as well as those due to cosmic-ray muons. Neutrons were propagated to the sensitive volume of the detector and the nuclear recoil spectra were calculated. Methods of neutron background suppression were also examined and limitations to the sensitivity of a gaseous dark matter detector are discussed. Results indicate that neutrons should not limit sensitivity to WIMP-nucleon interactions down to a level of (1 - 3) x 10^{-8} pb in a 10 kg detector.Comment: 27 pages (total, including 3 tables and 11 figures). Accepted for publication in Nuclear Instruments and Methods in Physics Research - Section

Coherently Scattering Atoms from an Excited Bose-Einstein Condensate

We consider scattering atoms from a fully Bose-Einstein condensed gas. If we take these atoms to be identical to those in the Bose-Einstein condensate, this scattering process is to a large extent analogous to Andreev reflection from the interface between a superconducting and a normal metal. We determine the scattering wave function both in the absence and the presence of a vortex. Our results show a qualitative difference between these two cases that can be understood as due to an Aharonov-Bohm effect. It leads to the possibility to experimentally detect and study vortices in this way.Comment: 5 pages of ReVTeX and 2 postscript figure

Glassiness and constrained dynamics of a short-range non-disordered spin model

We study the low temperature dynamics of a two dimensional short-range spin system with uniform ferromagnetic interactions, which displays glassiness at low temperatures despite the absence of disorder or frustration. The model has a dual description in terms of free defects subject to dynamical constraints, and is an explicit realization of the ``hierarchically constrained dynamics'' scenario for glassy systems. We give a number of exact results for the statics of the model, and study in detail the dynamical behaviour of one-time and two-time quantities. We also consider the role played by the configurational entropy, which can be computed exactly, in the relation between fluctuations and response.Comment: 10 pages, 9 figures; minor changes, references adde

On the complexity of strongly connected components in directed hypergraphs

We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure