Statistical equilibrium of tetrahedra from maximum entropy principle

Discrete formulations of (quantum) gravity in four spacetime dimensions build space out of tetrahedra. We investigate a statistical mechanical system of tetrahedra from a many-body point of view based on non-local, combinatorial gluing constraints that are modelled as multi-particle interactions. We focus on Gibbs equilibrium states, constructed using Jaynes' principle of constrained maximisation of entropy, which has been shown recently to play an important role in characterising equilibrium in background independent systems. We apply this principle first to classical systems of many tetrahedra using different examples of geometrically motivated constraints. Then for a system of quantum tetrahedra, we show that the quantum statistical partition function of a Gibbs state with respect to some constraint operator can be reinterpreted as a partition function for a quantum field theory of tetrahedra, taking the form of a group field theory.Comment: v3 published version; v2 18 pages, 4 figures, improved text in sections IIIC & IVB, minor changes elsewher

Towards trajectory anonymization: a generalization-based approach

Trajectory datasets are becoming popular due to the massive usage of GPS and locationbased services. In this paper, we address privacy issues regarding the identification of individuals in static trajectory datasets. We first adopt the notion of k-anonymity to trajectories and propose a novel generalization-based approach for anonymization of trajectories. We further show that releasing anonymized trajectories may still have some privacy leaks. Therefore we propose a randomization based reconstruction algorithm for releasing anonymized trajectory data and also present how the underlying techniques can be adapted to other anonymity standards. The experimental results on real and synthetic trajectory datasets show the effectiveness of the proposed techniques

Recent Advances in Graph Partitioning

We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions

Partial Enumerative Sphere Shaping

The dependency between the Gaussianity of the input distribution for the additive white Gaussian noise (AWGN) channel and the gap-to-capacity is discussed. We show that a set of particular approximations to the Maxwell-Boltzmann (MB) distribution virtually closes most of the shaping gap. We relate these symbol-level distributions to bit-level distributions, and demonstrate that they correspond to keeping some of the amplitude bit-levels uniform and independent of the others. Then we propose partial enumerative sphere shaping (P-ESS) to realize such distributions in the probabilistic amplitude shaping (PAS) framework. Simulations over the AWGN channel exhibit that shaping 2 amplitude bits of 16-ASK have almost the same performance as shaping 3 bits, which is 1.3 dB more power-efficient than uniform signaling at a rate of 3 bit/symbol. In this way, required storage and computational complexity of shaping are reduced by factors of 6 and 3, respectively.Comment: 6 pages, 6 figure

Structural matching by discrete relaxation

This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we locus on the issue of how relational inexactness may be quantified. We illustrate that several popular relational distance measures can be recovered as specific limiting cases of the Bayesian consistency measure. The second aspect of our comparison concerns the way in which structural inexactness is controlled. We investigate three different realizations ai the matching process which draw on contrasting control models. The main conclusion of our study is that the active process of graph-editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter