Two-stage graph estimation for complex motifs

In this article, I develop an Induced-Sequential-Sampling (ISS) algorithm for subgraph estimation and propose a two-stage graph estimation strategy for verifying complex motifs in large and directed networks. I also derive the asymptotic properties of the estimators for subgraph identification and motif verification, and the simulation results are consistent with expectations. Finally, I provide an example for demonstrating how the proposed framework can be applied to investigate fragmentation in real-world trade networks.