A fixed-point approximation for a routing model in equilibrium

We use a method of Luczak (arXiv:1212.3231) to investigate the equilibrium distribution of a dynamic routing model on a network. In this model, there are $n$ nodes, each pair joined by a link of capacity $C$. For each pair of nodes, calls arrive for this pair of endpoints as a Poisson process with rate $\lambda$. A call for endpoints $\{u,v\}$ is routed directly onto the link between the two nodes if there is spare capacity; otherwise $d$ two-link paths between $u$ and $v$ are considered, and the call is routed along a path with lowest maximum load, if possible. The duration of each call is an exponential random variable with unit mean. In the case $d=1$, it was suggested by Gibbens, Hunt and Kelly in 1990 that the equilibrium of this process is related to the fixed points of a certain equation. We show that this is indeed the case, for every $d \ge 1$, provided the arrival rate $\lambda$ is either sufficiently small or sufficiently large. In either regime, we show that the equation has a unique fixed point, and that, in equilibrium, for each $j$, the proportion of links at each node with load $j$ is strongly concentrated around the $j$th coordinate of the fixed point.Comment: 33 page

Universal homogeneous causal sets

Causal sets are particular partially ordered sets which have been proposed as a basic model for discrete space-time in quantum gravity. We show that the class C of all countable past-finite causal sets contains a unique causal set (U,<) which is universal (i.e., any member of C can be embedded into (U,<)) and homogeneous (i.e., (U,<) has maximal degree of symmetry). Moreover, (U,<) can be constructed both probabilistically and explicitly. In contrast, the larger class of all countable causal sets does not contain a universal object.Comment: 14 page

Gravity and Matter in Causal Set Theory

The goal of this paper is to propose an approach to the formulation of dynamics for causal sets and coupled matter fields. We start from the continuum version of the action for a Klein-Gordon field coupled to gravity, and rewrite it first using quantities that have a direct correspondent in the case of a causal set, namely volumes, causal relations, and timelike lengths, as variables to describe the geometry. In this step, the local Lagrangian density $L(f;x)$ for a set of fields $f$ is recast into a quasilocal expression $L_0(f;p,q)$ that depends on pairs of causally related points $p \prec q$ and is a function of the values of $f$ in the Alexandrov set defined by those points, and whose limit as $p$ and $q$ approach a common point $x$ is $L(f;x)$. We then describe how to discretize $L_0(f;p,q)$, and use it to define a discrete action.Comment: 13 pages, no figures; In version 2, friendlier results than in version 1 are obtained following much shorter derivation

Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions

For the hard-core lattice gas model defined on independent sets weighted by an activity $\lambda$, we study the critical activity $\lambda_c(\mathbb{Z}^2)$ for the uniqueness/non-uniqueness threshold on the 2-dimensional integer lattice $\mathbb{Z}^2$. The conjectured value of the critical activity is approximately $3.796$. Until recently, the best lower bound followed from algorithmic results of Weitz (2006). Weitz presented an FPTAS for approximating the partition function for graphs of constant maximum degree $\Delta$ when $\lambda<\lambda_c(\mathbb{T}_\Delta)$ where $\mathbb{T}_\Delta$ is the infinite, regular tree of degree $\Delta$. His result established a certain decay of correlations property called strong spatial mixing (SSM) on $\mathbb{Z}^2$ by proving that SSM holds on its self-avoiding walk tree $T_{\mathrm{saw}}^\sigma(\mathbb{Z}^2)$ where $\sigma=(\sigma_v)_{v\in \mathbb{Z}^2}$ and $\sigma_v$ is an ordering on the neighbors of vertex $v$. As a consequence he obtained that $\lambda_c(\mathbb{Z}^2)\geq\lambda_c( \mathbb{T}_4) = 1.675$. Restrepo et al. (2011) improved Weitz's approach for the particular case of $\mathbb{Z}^2$ and obtained that $\lambda_c(\mathbb{Z}^2)>2.388$. In this paper, we establish an upper bound for this approach, by showing that, for all $\sigma$, SSM does not hold on $T_{\mathrm{saw}}^\sigma(\mathbb{Z}^2)$ when $\lambda>3.4$. We also present a refinement of the approach of Restrepo et al. which improves the lower bound to $\lambda_c(\mathbb{Z}^2)>2.48$.Comment: 19 pages, 1 figure. Polished proofs and examples compared to earlier versio

Occurrence of genes encoding spore germination in Clostridium species that cause meat spoilage

Publishe

The Random Discrete Action for 2-Dimensional Spacetime

A one-parameter family of random variables, called the Discrete Action, is defined for a 2-dimensional Lorentzian spacetime of finite volume. The single parameter is a discreteness scale. The expectation value of this Discrete Action is calculated for various regions of 2D Minkowski spacetime. When a causally convex region of 2D Minkowski spacetime is divided into subregions using null lines the mean of the Discrete Action is equal to the alternating sum of the numbers of vertices, edges and faces of the null tiling, up to corrections that tend to zero as the discreteness scale is taken to zero. This result is used to predict that the mean of the Discrete Action of the flat Lorentzian cylinder is zero up to corrections, which is verified. The ``topological'' character of the Discrete Action breaks down for causally convex regions of the flat trousers spacetime that contain the singularity and for non-causally convex rectangles.Comment: 20 pages, 10 figures, Typos correcte

Spacetime topology from the tomographic histories approach: Part II

As an inverse problem, we recover the topology of the effective spacetime that a system lies in, in an operational way. This means that from a series of experiments we get a set of points corresponding to events. This continues the previous work done by the authors. Here we use the existence of upper bound in the speed of transfer of matter and information to induce a partial order on the set of events. While the actual partial order is not known in our operational set up, the grouping of events to (unordered) subsets corresponding to possible histories, is given. From this we recover the partial order up to certain ambiguities that are then classified. Finally two different ways to recover the topology are sketched and their interpretation is discussed.Comment: 21 pages, slight change in title and certain minor corrections in this second version. To apear in IJT