An Efficient Sampling Algorithm for Network Motif Detection

DOI10.1080/10618600.2017.1391696OpenAlexW2766743208MaRDI QIDQ3391081

Yuguo Chen, Yinghan Chen

Publication date: 28 March 2022

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10618600.2017.1391696

zbMATH Keywords

sequential importance samplingmotif detectionsubgraph concentration

Mathematics Subject Classification ID

Statistics (62-XX)

Related Items (4)

On the efficacy of higher-order spectral clustering under weighted stochastic block models ⋮ Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting ⋮ A motif building process for simulating random networks ⋮ Motif discovery in networks: a survey

Uses Software

• igraph
• Kavosh

Cites Work

• A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
• Emergence of Scaling in Random Networks
• Sampling for Conditional Inference on Network Data

This page was built for publication: An Efficient Sampling Algorithm for Network Motif Detection