Melonic phase transition in group field theory

Group field theories have recently been shown to admit a 1/N expansion dominated by so-called `melonic graphs', dual to triangulated spheres. In this note, we deepen the analysis of this melonic sector. We obtain a combinatorial formula for the melonic amplitudes in terms of a graph polynomial related to a higher dimensional generalization of the Kirchhoff tree-matrix theorem. Simple bounds on these amplitudes show the existence of a phase transition driven by melonic interaction processes. We restrict our study to the Boulatov-Ooguri models, which describe topological BF theories and are the basis for the construction of four dimensional models of quantum gravity.Comment: 8 pages, 4 figures; to appear in Letters in Mathematical Physic

Scaling of waves in the Bak-Tang-Wiesenfeld sandpile model

We study probability distributions of waves of topplings in the Bak-Tang-Wiesenfeld model on hypercubic lattices for dimensions D>=2. Waves represent relaxation processes which do not contain multiple toppling events. We investigate bulk and boundary waves by means of their correspondence to spanning trees, and by extensive numerical simulations. While the scaling behavior of avalanches is complex and usually not governed by simple scaling laws, we show that the probability distributions for waves display clear power law asymptotic behavior in perfect agreement with the analytical predictions. Critical exponents are obtained for the distributions of radius, area, and duration, of bulk and boundary waves. Relations between them and fractal dimensions of waves are derived. We confirm that the upper critical dimension D_u of the model is 4, and calculate logarithmic corrections to the scaling behavior of waves in D=4. In addition we present analytical estimates for bulk avalanches in dimensions D>=4 and simulation data for avalanches in D<=3. For D=2 they seem not easy to interpret.Comment: 12 pages, 17 figures, submitted to Phys. Rev.

Fundamental Cycles and Graph Embeddings

In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum genus of a graph

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that, for each node, its neighborhood in T induces a connected sub- graph in G. The problem of determining whether a graph contains an LCST or not has been proved to be NP-complete, even if the graph is planar or chordal. The main result of this paper is a simple linear time algorithm that, given a maximal planar chordal graph, determines in linear time whether it contains an LCST or not, and produces one if it exists. We give an anal- ogous result for the case when the input graph is a maximal outerplanar graph