362 research outputs found

    Universal homogeneous causal sets

    Full text link
    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

    Fluctuations in a general preferential attachment model via Stein's method

    Get PDF
    We consider a general preferential attachment model, where the probability that a newly arriving vertex connects to an older vertex is proportional to a sublinear function of the indegree of the older vertex at that time. It is well known that the distribution of a uniformly chosen vertex converges to a limiting distribution. Depending on the parameters, this model can show power law, but also stretched exponential behaviour. Using Stein's method we provide rates of convergence for the total variation distance. Our proof uses the fact that the limiting distribution is the stationary distribution of a Markov chain together with the generator method of Barbour

    Gravity and Matter in Causal Set Theory

    Full text link
    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)L(f;x) for a set of fields ff is recast into a quasilocal expression L0(f;p,q)L_0(f;p,q) that depends on pairs of causally related points pqp \prec q and is a function of the values of ff in the Alexandrov set defined by those points, and whose limit as pp and qq approach a common point xx is L(f;x)L(f;x). We then describe how to discretize L0(f;p,q)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

    Full text link
    For the hard-core lattice gas model defined on independent sets weighted by an activity λ\lambda, we study the critical activity λc(Z2)\lambda_c(\mathbb{Z}^2) for the uniqueness/non-uniqueness threshold on the 2-dimensional integer lattice Z2\mathbb{Z}^2. The conjectured value of the critical activity is approximately 3.7963.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 λ<λc(TΔ)\lambda<\lambda_c(\mathbb{T}_\Delta) where TΔ\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 Z2\mathbb{Z}^2 by proving that SSM holds on its self-avoiding walk tree Tsawσ(Z2)T_{\mathrm{saw}}^\sigma(\mathbb{Z}^2) where σ=(σv)vZ2\sigma=(\sigma_v)_{v\in \mathbb{Z}^2} and σv\sigma_v is an ordering on the neighbors of vertex vv. As a consequence he obtained that λc(Z2)λc(T4)=1.675\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 Z2\mathbb{Z}^2 and obtained that λc(Z2)>2.388\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 Tsawσ(Z2)T_{\mathrm{saw}}^\sigma(\mathbb{Z}^2) when λ>3.4\lambda>3.4. We also present a refinement of the approach of Restrepo et al. which improves the lower bound to λc(Z2)>2.48\lambda_c(\mathbb{Z}^2)>2.48.Comment: 19 pages, 1 figure. Polished proofs and examples compared to earlier versio

    Spacetime topology from the tomographic histories approach: Part II

    Full text link
    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

    The Random Walk in Generalized Quantum Theory

    Full text link
    One can view quantum mechanics as a generalization of classical probability theory that provides for pairwise interference among alternatives. Adopting this perspective, we ``quantize'' the classical random walk by finding, subject to a certain condition of ``strong positivity'', the most general Markovian, translationally invariant ``decoherence functional'' with nearest neighbor transitions.Comment: 25 pages, no figure

    Spacelike distance from discrete causal order

    Get PDF
    Any discrete approach to quantum gravity must provide some prescription as to how to deduce continuum properties from the discrete substructure. In the causal set approach it is straightforward to deduce timelike distances, but surprisingly difficult to extract spacelike distances, because of the unique combination of discreteness with local Lorentz invariance in that approach. We propose a number of methods to overcome this difficulty, one of which reproduces the spatial distance between two points in a finite region of Minkowski space. We provide numerical evidence that this definition can be used to define a `spatial nearest neighbor' relation on a causal set, and conjecture that this can be exploited to define the length of `continuous curves' in causal sets which are approximated by curved spacetime. This provides evidence in support of the ``Hauptvermutung'' of causal sets.Comment: 32 pages, 16 figures, revtex4; journal versio

    Causal Sets: Quantum gravity from a fundamentally discrete spacetime

    Get PDF
    In order to construct a quantum theory of gravity, we may have to abandon certain assumptions we were making. In particular, the concept of spacetime as a continuum substratum is questioned. Causal Sets is an attempt to construct a quantum theory of gravity starting with a fundamentally discrete spacetime. In this contribution we review the whole approach, focusing on some recent developments in the kinematics and dynamics of the approach.Comment: 10 pages, review of causal sets based on talk given at the 1st MCCQG conferenc

    Dense packing on uniform lattices

    Full text link
    We study the Hard Core Model on the graphs G{\rm {\bf \scriptstyle G}} obtained from Archimedean tilings i.e. configurations in {0,1}G\scriptstyle \{0,1\}^{{\rm {\bf G}}} with the nearest neighbor 1's forbidden. Our particular aim in choosing these graphs is to obtain insight to the geometry of the densest packings in a uniform discrete set-up. We establish density bounds, optimal configurations reaching them in all cases, and introduce a probabilistic cellular automaton that generates the legal configurations. Its rule involves a parameter which can be naturally characterized as packing pressure. It can have a critical value but from packing point of view just as interesting are the noncritical cases. These phenomena are related to the exponential size of the set of densest packings and more specifically whether these packings are maximally symmetric, simple laminated or essentially random packings.Comment: 18 page

    The Random Discrete Action for 2-Dimensional Spacetime

    Full text link
    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
    corecore