Approximately counting embeddings into random graphs

Martin Fürer, Shiva Prasad Kasiviswanathan

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous results cover only a few specific instances of this general problem, for example the case when H has degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge is between vertices with different labels, and for every vertex all neighbours with a higher label have identical labels. The labelling implicitly generates a sequence of bipartite graphs, which permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipartite graphs generated is small and almost all graphs G, the algorithm is a fully polynomial randomized approximation scheme. We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, boundeddegree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs of large girth, whereas unbounded-width grid graphs are excluded. Moreover, our general technique can easily be applied to proving many more similar results.

    Original languageEnglish (US)
    Pages (from-to)1028-1056
    Number of pages29
    JournalCombinatorics Probability and Computing
    Volume23
    Issue number6
    DOIs
    StatePublished - Nov 2 2014

    Fingerprint

    Random Graphs
    Labels
    Counting
    Polynomial approximation
    Decomposition
    Labeling
    Graph in graph theory
    Subgraph
    Grid Graph
    Counting Problems
    Dimers
    Approximation Scheme
    Monomers
    Bipartite Graph
    Graph Decomposition
    Series-parallel Graph
    Decompose
    Outerplanar Graph
    Isomorphism Problem
    Polynomial

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Statistics and Probability
    • Computational Theory and Mathematics
    • Applied Mathematics

    Cite this

    Fürer, Martin ; Kasiviswanathan, Shiva Prasad. / Approximately counting embeddings into random graphs. In: Combinatorics Probability and Computing. 2014 ; Vol. 23, No. 6. pp. 1028-1056.
    @article{8d631cc606fc42fa9b8b9f07532e53c6,
    title = "Approximately counting embeddings into random graphs",
    abstract = "Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous results cover only a few specific instances of this general problem, for example the case when H has degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge is between vertices with different labels, and for every vertex all neighbours with a higher label have identical labels. The labelling implicitly generates a sequence of bipartite graphs, which permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipartite graphs generated is small and almost all graphs G, the algorithm is a fully polynomial randomized approximation scheme. We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, boundeddegree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs of large girth, whereas unbounded-width grid graphs are excluded. Moreover, our general technique can easily be applied to proving many more similar results.",
    author = "Martin F{\"u}rer and Kasiviswanathan, {Shiva Prasad}",
    year = "2014",
    month = "11",
    day = "2",
    doi = "10.1017/S0963548314000339",
    language = "English (US)",
    volume = "23",
    pages = "1028--1056",
    journal = "Combinatorics Probability and Computing",
    issn = "0963-5483",
    publisher = "Cambridge University Press",
    number = "6",

    }

    Approximately counting embeddings into random graphs. / Fürer, Martin; Kasiviswanathan, Shiva Prasad.

    In: Combinatorics Probability and Computing, Vol. 23, No. 6, 02.11.2014, p. 1028-1056.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Approximately counting embeddings into random graphs

    AU - Fürer, Martin

    AU - Kasiviswanathan, Shiva Prasad

    PY - 2014/11/2

    Y1 - 2014/11/2

    N2 - Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous results cover only a few specific instances of this general problem, for example the case when H has degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge is between vertices with different labels, and for every vertex all neighbours with a higher label have identical labels. The labelling implicitly generates a sequence of bipartite graphs, which permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipartite graphs generated is small and almost all graphs G, the algorithm is a fully polynomial randomized approximation scheme. We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, boundeddegree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs of large girth, whereas unbounded-width grid graphs are excluded. Moreover, our general technique can easily be applied to proving many more similar results.

    AB - Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous results cover only a few specific instances of this general problem, for example the case when H has degree at most one (the monomer-dimer problem). In this paper we present the first general subcase of the subgraph isomorphism counting problem, which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labelling of the vertices such that every edge is between vertices with different labels, and for every vertex all neighbours with a higher label have identical labels. The labelling implicitly generates a sequence of bipartite graphs, which permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipartite graphs generated is small and almost all graphs G, the algorithm is a fully polynomial randomized approximation scheme. We show that the graph classes of H for which we obtain a fully polynomial randomized approximation scheme for almost all G includes graphs of degree at most two, boundeddegree forests, bounded-width grid graphs, subdivision of bounded-degree graphs, and major subclasses of outerplanar graphs, series-parallel graphs and planar graphs of large girth, whereas unbounded-width grid graphs are excluded. Moreover, our general technique can easily be applied to proving many more similar results.

    UR - http://www.scopus.com/inward/record.url?scp=84914157998&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84914157998&partnerID=8YFLogxK

    U2 - 10.1017/S0963548314000339

    DO - 10.1017/S0963548314000339

    M3 - Article

    AN - SCOPUS:84914157998

    VL - 23

    SP - 1028

    EP - 1056

    JO - Combinatorics Probability and Computing

    JF - Combinatorics Probability and Computing

    SN - 0963-5483

    IS - 6

    ER -