• Corpus ID: 246823747

Fast and perfect sampling of subgraphs and polymer systems

  title={Fast and perfect sampling of subgraphs and polymer systems},
  author={Antonio Blanca and Sarah Cannon and Will Perkins},
We give an efficient perfect sampling algorithm for weighted, connected induced subgraphs (or graphlets ) of rooted, bounded degree graphs. Our algorithm utilizes a vertex-percolation process with a carefully chosen rejection filter and works under a percolation subcriticality condition. We show that this condition is optimal in the sense that the task of (approximately) sampling weighted rooted graphlets becomes impossible in finite expected time for infinite graphs and intractable for finite graphs… 
1 Citations

Tables from this paper

Algorithms for the ferromagnetic Potts model on expanders
Algorithm for approximating the partition function of the ferromagnetic Potts model on d -regular expanding graphs, using extremal graph theory and applications of Karger’s algorithm to counting cuts that may be of independent interest.


Efficient and near-optimal algorithms for sampling connected subgraphs
A near-optimal mixing time bound for the classic k-graphlet random walk, as a function of the mixing time of G, and the first efficient algorithm for uniform graphlet sampling.
Graph animals, subgraph sampling, and motif search in large networks.
A sampling algorithm for lattice animals is generalized to a Monte Carlo algorithm for "graph animals," i.e., connected subgraphs in arbitrary networks, and a number of methods that do not rely on measurements of Z scores or comparisons with null models are explored.
Fast mixing via polymers for random graphs with unbounded degree
A less restrictive framework for polymer models that relaxes the standard bounded-degree assumption is developed, by reworking the relevant polymer models from the edge perspective, and the techniques also extend to more general spin systems.
Algorithms for #BIS-hard problems on expander graphs
An FPTAS and an efficient sampling algorithm are given and efficient counting and sampling algorithms are found for proper $q$-colorings of random $\Delta$-regular bipartite graphs when q is sufficiently small as a function of $\Delta$.
Fast Algorithms for General Spin Systems on Bipartite Expanders
This work develops fast approximate sampling and counting algorithms for general spin systems whenever the degree and the spectral gap of the graph are sufficiently large, which guarantees that the spin system is in the so-called low-temperature regime.
Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts
A sampling algorithm that provably and accurately approximates the frequencies of all 4-vertex pattern subgraphs is provided, based on a novel technique of 3-path sampling and a special pruning scheme to decrease the variance in estimates.
Approximately counting independent sets in bipartite graphs via graph containers
By implementing algorithmic versions of Sapozhenko’s graph container methods, new algorithms for approximating the number of independent sets in bipartite graphs satisfying a weak expansion condition are given.
Motif Counting Beyond Five Nodes
This work shows, perhaps surprisingly, that very simple and natural algorithms based on Monte Carlo sampling of Markov Chains are outperformed by color coding (CC) [2], a sophisticated algorithmic technique that is extended to the case of graphlet sampling and for which it is proved strong statistical guarantees.
Sampling Connected Induced Subgraphs Uniformly at Random
This paper devise, present and discuss several algorithms that leverage three different techniques: Rejection Sampling, Random Walk and Markov Chain Monte Carlo, and proposes one novel algorithm, which is called Neighbour Reservoir Sampling (NRS), that very successfully realizes the trade-off between effectiveness and efficiency.
Counting Graphlets: Space vs Time
This work shows that a careful implementation of color coding (CC) can push the limits of the state of the art, both in terms of the size of the input graph and of that of the graphlets, and formally shows that the mixing time of the MC approach is too high in general.