Thermodynamic graph-rewriting

We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules called generating rules, a finite set of connected graphs P called energy patterns and an energy cost function. The idea is that the generators define the qualitative dynamics, by showing which transformations are possible, while the energy patterns and cost function specify the long-term probability $\pi$ of any reachable graph. Given the generators and energy patterns, we construct a finite set of rules which (i) has the same qualitative transition system as the generators; and (ii) when equipped with suitable rates, defines a continuous-time Markov chain of which $\pi$ is the unique fixed point. The construction relies on the use of site graphs and a technique of `growth policy' for quantitative rule refinement which is of independent interest. This division of labour between the qualitative and long-term quantitative aspects of the dynamics leads to intuitive and concise descriptions for realistic models (see the examples in S4 and S5). It also guarantees thermodynamical consistency (AKA detailed balance), otherwise known to be undecidable, which is important for some applications. Finally, it leads to parsimonious parameterizations of models, again an important point in some applications

Batalin-Vilkovisky Integrals in Finite Dimensions

The Batalin-Vilkovisky method (BV) is the most powerful method to analyze functional integrals with (infinite-dimensional) gauge symmetries presently known. It has been invented to fix gauges associated with symmetries that do not close off-shell. Homological Perturbation Theory is introduced and used to develop the integration theory behind BV and to describe the BV quantization of a Lagrangian system with symmetries. Localization (illustrated in terms of Duistermaat-Heckman localization) as well as anomalous symmetries are discussed in the framework of BV.Comment: 35 page

Canny Algorithm: A New Estimator for Primordial Non-Gaussianities

We utilize the Canny edge detection algorithm as an estimator for primordial non-Gaussianities. In preliminary tests on simulated sky patches with a window size of 57 degrees and multipole moments $l$ up to 1024, we find a $3\sigma$ distinction between maps with local non-Gaussianity $f_{NL}=350$ (or $f_{NL}=-700$) and Gaussian maps. We present evidence that high resolution CMB studies will strongly enhance the sensitivity of the Canny algorithm to non-Gaussianity, making it a promising technique to estimate primordial non-Gaussianity.Comment: 4 pages, 4 figures; v2. 5pp, as submitted to PRD; v3. 5pp, minor clarifications and added discussion of negative fNL value

Distribution-based bisimulation for labelled Markov processes

In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribution bisimulation and discuss linearity, continuity and compositional properties.Comment: Accepted by FORMATS 201

The Grail theorem prover: Type theory for syntax and semantics

As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory. From the prespective of grammar design, type-logical grammars develop the syntactic and semantic aspects of linguistic phenomena hand-in-hand, letting the desired semantics of an expression inform the syntactic type and vice versa. Prototypical examples of the successful application of type-logical grammars to the syntax-semantics interface include coordination, quantifier scope and extraction.This chapter describes the Grail theorem prover, a series of tools for designing and testing grammars in various modern type-logical grammars which functions as a tool . All tools described in this chapter are freely available

Open Transactions on Shared Memory

Transactional memory has arisen as a good way for solving many of the issues of lock-based programming. However, most implementations admit isolated transactions only, which are not adequate when we have to coordinate communicating processes. To this end, in this paper we present OCTM, an Haskell-like language with open transactions over shared transactional memory: processes can join transactions at runtime just by accessing to shared variables. Thus a transaction can co-operate with the environment through shared variables, but if it is rolled-back, also all its effects on the environment are retracted. For proving the expressive power of TCCS we give an implementation of TCCS, a CCS-like calculus with open transactions

Outcome Independence of Entanglement in One-Way Computation

We show that the various intermediate states appearing in the process of one-way computation at a given step of measurement are all equivalent modulo local unitary transformations. This implies, in particular, that all those intermediate states share the same entanglement irrespective of the measurement outcomes, indicating that the process of one-way computation is essentially unique with respect to local quantum operations.Comment: 6 pages, 4 figure

Interaction Rates in String Gas Cosmology

We study string interaction rates in the Brandenberger-Vafa scenario, the very early universe cosmology of a gas of strings. This cosmology starts with the assumption that all spatial dimensions are compact and initially have string scale radii; some dimensions grow due to some thermal or quantum fluctuation which acts as an initial expansion velocity. Based on simple arguments from the low energy equations of motion and string thermodynamics, we demonstrate that the interaction rates of strings are negligible, so the common assumption of thermal equilibrium cannot apply. We also present a new analysis of the cosmological evolution of strings on compact manifolds of large radius. Then we discuss modifications that should be considered to the usual Brandenberger-Vafa scenario. To confirm our simple arguments, we give a numerical calculation of the annihilation rate of winding strings. In calculating the rate, we also show that the quantum mechanics of strings in small spaces is important.Comment: 28pp, 3 figures, RevTeX