Survival of branching random walks in random environment

We study survival of nearest-neighbour branching random walks in random environment (BRWRE) on ${\mathbb Z}$. A priori there are three different regimes of survival: global survival, local survival, and strong local survival. We show that local and strong local survival regimes coincide for BRWRE and that they can be characterized with the spectral radius of the first moment matrix of the process. These results are generalizations of the classification of BRWRE in recurrent and transient regimes. Our main result is a characterization of global survival that is given in terms of Lyapunov exponents of an infinite product of i.i.d. $2\times 2$ random matrices.Comment: 17 pages; to appear in Journal of Theoretical Probabilit

Survival, extinction and approximation of discrete-time branching random walks

We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that, while the local behavior is characterized by M, the global behavior cannot be completely described in terms of properties involving M alone. Moreover we show that locally surviving branching random walks can be approximated by sequences of spatially confined and stochastically dominated branching random walks which eventually survive locally if the (possibly finite) state space is large enough. An analogous result can be achieved by approximating a branching random walk by a sequence of multitype contact processes and allowing a sufficiently large number of particles per site. We compare these results with the ones obtained in the continuous-time case and we give some examples and counterexamples.Comment: 32 pages, a few misprints have been correcte

Non-Equilibrium Statistical Physics of Currents in Queuing Networks

We consider a stable open queuing network as a steady non-equilibrium system of interacting particles. The network is completely specified by its underlying graphical structure, type of interaction at each node, and the Markovian transition rates between nodes. For such systems, we ask the question ``What is the most likely way for large currents to accumulate over time in a network ?'', where time is large compared to the system correlation time scale. We identify two interesting regimes. In the first regime, in which the accumulation of currents over time exceeds the expected value by a small to moderate amount (moderate large deviation), we find that the large-deviation distribution of currents is universal (independent of the interaction details), and there is no long-time and averaged over time accumulation of particles (condensation) at any nodes. In the second regime, in which the accumulation of currents over time exceeds the expected value by a large amount (severe large deviation), we find that the large-deviation current distribution is sensitive to interaction details, and there is a long-time accumulation of particles (condensation) at some nodes. The transition between the two regimes can be described as a dynamical second order phase transition. We illustrate these ideas using the simple, yet non-trivial, example of a single node with feedback.Comment: 26 pages, 5 figure

Persistent Spin Currents in Helimagnets

We demonstrate that weak external magnetic fields generate dissipationless spin currents in the ground state of systems with spiral magnetic order. Our conclusions are based on phenomenological considerations and on microscopic mean-field theory calculations for an illustrative toy model. We speculate on possible applications of this effect in spintronic devices.Comment: 9 pages, 6 figures, updated version as published, Journal referenc

Experimental Study of the Shortest Reset Word of Random Automata

In this paper we describe an approach to finding the shortest reset word of a finite synchronizing automaton by using a SAT solver. We use this approach to perform an experimental study of the length of the shortest reset word of a finite synchronizing automaton. The largest automata we considered had 100 states. The results of the experiments allow us to formulate a hypothesis that the length of the shortest reset word of a random finite automaton with $n$ states and 2 input letters with high probability is sublinear with respect to $n$ and can be estimated as $1.95 n^{0.55}.

Two-proton correlations from 158 AGeV Pb+Pb central collisions

The two-proton correlation function at midrapidity from Pb+Pb central collisions at 158 AGeV has been measured by the NA49 experiment. The results are compared to model predictions from static thermal Gaussian proton source distributions and transport models RQMD and VENUS. An effective proton source size is determined by minimizing CHI-square/ndf between the correlation functions of the data and those calculated for the Gaussian sources, yielding 3.85 +-0.15(stat.) +0.60-0.25(syst.) fm. Both the RQMD and the VENUS model are consistent with the data within the error in the correlation peak region.Comment: RevTeX style, 6 pages, 4 figures, 1 table. More discussion are added about the structure on the tail of the correlation function. The systematic error is revised. To appear in Phys. Lett.

Event-by-event fluctuations of average transverse momentum in central Pb+Pb collisions at 158 GeV per nucleon

We present first data on event-by-event fluctuations in the average transverse momentum of charged particles produced in Pb+Pb collisions at the CERN SPS. This measurement provides previously unavailable information allowing sensitive tests of microscopic and thermodynamic collision models and to search for fluctuations expected to occur in the vicinity of the predicted QCD phase transition. We find that the observed variance of the event-by-event average transverse momentum is consistent with independent particle production modified by the known two-particle correlations due to quantum statistics and final state interactions and folded with the resolution of the NA49 apparatus. For two specific models of non-statistical fluctuations in transverse momentum limits are derived in terms of fluctuation amplitude. We show that a significant part of the parameter space for a model of isospin fluctuations predicted as a consequence of chiral symmetry restoration in a non-equilibrium scenario is excluded by our measurement.Comment: 6 pages, 2 figures, submitted to Phys. Lett.

One-dimensional Particle Processes with Acceleration/Braking Asymmetry

The slow-to-start mechanism is known to play an important role in the particular shape of the Fundamental diagram of traffic and to be associated to hysteresis effects of traffic flow.We study this question in the context of exclusion and queueing processes,by including an asymmetry between deceleration and acceleration in the formulation of these processes. For exclusions processes, this corresponds to a multi-class process with transition asymmetry between different speed levels, while for queueing processes we consider non-reversible stochastic dependency of the service rate w.r.t the number of clients. The relationship between these 2 families of models is analyzed on the ring geometry, along with their steady state properties. Spatial condensation phenomena and metastability is observed, depending on the level of the aforementioned asymmetry. In addition we provide a large deviation formulation of the fundamental diagram (FD) which includes the level of fluctuations, in the canonical ensemble when the stationary state is expressed as a product form of such generalized queues.Comment: 28 pages, 8 figure