82 research outputs found

    Minimum vertex degree conditions for loose spanning trees in 3-graphs

    Full text link
    In 1995, Koml\'os, S\'ark\"ozy and Szemer\'edi showed that every large nn-vertex graph with minimum degree at least (1/2+γ)n(1/2 + \gamma)n contains all spanning trees of bounded degree. We consider a generalization of this result to loose spanning hypertrees in 3-graphs, that is, linear hypergraphs obtained by successively appending edges sharing a single vertex with a previous edge. We show that for all γ\gamma and Δ\Delta, and nn large, every nn-vertex 3-uniform hypergraph of minimum vertex degree (5/9+γ)(n2)(5/9 + \gamma)\binom{n}{2} contains every loose spanning tree TT with maximum vertex degree Δ\Delta. This bound is asymptotically tight, since some loose trees contain perfect matchings.Comment: 18 pages, 1 figur

    Grassmann Integral Representation for Spanning Hyperforests

    Full text link
    Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and unrooted spanning (hyper)forests and spanning (hyper)trees. All these results are generalizations of Kirchhoff's matrix-tree theorem. Furthermore, we show that the class of integrals describing unrooted spanning (hyper)forests is induced by a theory with an underlying OSP(1|2) supersymmetry.Comment: 50 pages, it uses some latex macros. Accepted for publication on J. Phys.

    Finite Volume Spaces and Sparsification

    Full text link
    We introduce and study finite dd-volumes - the high dimensional generalization of finite metric spaces. Having developed a suitable combinatorial machinery, we define 1\ell_1-volumes and show that they contain Euclidean volumes and hypertree volumes. We show that they can approximate any dd-volume with O(nd)O(n^d) multiplicative distortion. On the other hand, contrary to Bourgain's theorem for d=1d=1, there exists a 22-volume that on nn vertices that cannot be approximated by any 1\ell_1-volume with distortion smaller than Ω~(n1/5)\tilde{\Omega}(n^{1/5}). We further address the problem of 1\ell_1-dimension reduction in the context of 1\ell_1 volumes, and show that this phenomenon does occur, although not to the same striking degree as it does for Euclidean metrics and volumes. In particular, we show that any 1\ell_1 metric on nn points can be (1+ϵ)(1+ \epsilon)-approximated by a sum of O(n/ϵ2)O(n/\epsilon^2) cut metrics, improving over the best previously known bound of O(nlogn)O(n \log n) due to Schechtman. In order to deal with dimension reduction, we extend the techniques and ideas introduced by Karger and Bencz{\'u}r, and Spielman et al.~in the context of graph Sparsification, and develop general methods with a wide range of applications.Comment: previous revision was the wrong file: the new revision: changed (extended considerably) the treatment of finite volumes (see revised abstract). Inserted new applications for the sparsification technique

    Fast and compact self-stabilizing verification, computation, and fault detection of an MST

    Get PDF
    This paper demonstrates the usefulness of distributed local verification of proofs, as a tool for the design of self-stabilizing algorithms.In particular, it introduces a somewhat generalized notion of distributed local proofs, and utilizes it for improving the time complexity significantly, while maintaining space optimality. As a result, we show that optimizing the memory size carries at most a small cost in terms of time, in the context of Minimum Spanning Tree (MST). That is, we present algorithms that are both time and space efficient for both constructing an MST and for verifying it.This involves several parts that may be considered contributions in themselves.First, we generalize the notion of local proofs, trading off the time complexity for memory efficiency. This adds a dimension to the study of distributed local proofs, which has been gaining attention recently. Specifically, we design a (self-stabilizing) proof labeling scheme which is memory optimal (i.e., O(logn)O(\log n) bits per node), and whose time complexity is O(log2n)O(\log ^2 n) in synchronous networks, or O(Δlog3n)O(\Delta \log ^3 n) time in asynchronous ones, where Δ\Delta is the maximum degree of nodes. This answers an open problem posed by Awerbuch and Varghese (FOCS 1991). We also show that Ω(logn)\Omega(\log n) time is necessary, even in synchronous networks. Another property is that if ff faults occurred, then, within the requireddetection time above, they are detected by some node in the O(flogn)O(f\log n) locality of each of the faults.Second, we show how to enhance a known transformer that makes input/output algorithms self-stabilizing. It now takes as input an efficient construction algorithm and an efficient self-stabilizing proof labeling scheme, and produces an efficient self-stabilizing algorithm. When used for MST, the transformer produces a memory optimal self-stabilizing algorithm, whose time complexity, namely, O(n)O(n), is significantly better even than that of previous algorithms. (The time complexity of previous MST algorithms that used Ω(log2n)\Omega(\log^2 n) memory bits per node was O(n2)O(n^2), and the time for optimal space algorithms was O(nE)O(n|E|).) Inherited from our proof labelling scheme, our self-stabilising MST construction algorithm also has the following two properties: (1) if faults occur after the construction ended, then they are detected by some nodes within O(log2n)O(\log ^2 n) time in synchronous networks, or within O(Δlog3n)O(\Delta \log ^3 n) time in asynchronous ones, and (2) if ff faults occurred, then, within the required detection time above, they are detected within the O(flogn)O(f\log n) locality of each of the faults. We also show how to improve the above two properties, at the expense of some increase in the memory

    From hypertrees to arboreal quasi-ultrametrics

    Get PDF
    AbstractSome classical models of clustering (hierarchies, pyramids, etc.) are related to interval hypergraphs. In this paper we study clustering models related to hypertrees which are an extension of interval hypergraphs. We first prove that a hypertree can be characterized by an order on its vertices, this order allowing to find one of its underlying vertex trees. We then focus on clustering models associated to dissimilarity models and prove that if one of the cluster hypergraph, ball hypergraph, or 2-ball hypergraph related to a given dissimilarity is a hypertree, then the two others are also hypertrees. Moreover, we prove that a given dissimilarity admits at least one lower-maximal dissimilarity whose cluster hypergraph is a hypertree, and one and only one lower-maximal quasi-ultrametric whose cluster hypergraph is a hypertree. The construction of the lower-maximal quasi-ultrametric whose cluster hypergraph is a hypertree can be performed in polynomial time
    corecore