An Efficient Sampling Algorithm for Network Motif Detection

We propose a sequential importance sampling strategy to estimate subgraph frequencies and detect network motifs. The method is developed by sampling subgraphs sequentially node by node using a care…

The Self-Multiset Sampler

The multiset sampler has been shown to be an effective algorithm to sample from complex multimodal distributions, but the multiset sampler requires that the parameters in the target distribution ca…

Conditional Inference on Tables With Structural Zeros

We develop a set of sequential importance sampling (SIS) strategies for sampling nearly uniformly from two-way zero-one or contingency tables with fixed marginal sums and a given set of structural …

Monte Carlo Algorithms for Identifying Densely Connected Subgraphs

The problem of finding densely connected subgraphs in a network has attracted a lot of recent interest. Such subgraphs are sometimes referred to as communities in social networks or molecular modul…

Discussion of “Co-citation and Co-authorship Networks of Statisticians”