A Fast Counting Method for 6-Motifs with Low Connectivity

DOI10.1007/978-3-030-43120-4_25OpenAlexW3013978333MaRDI QIDQ5014689

Taha Sevim, Muhammet Selçuk Güvel, Lale Özkahya

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.06957

zbMATH Keywords

social networkssubgraph countingmotif analysis

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Triad count statistics
• Triangle Sparsifiers
• Wedge sampling for computing clustering coefficients and triangle counts on large graphs^†
• Collective dynamics of ‘small-world’ networks
• Approximating the Number of Network Motifs

This page was built for publication: A Fast Counting Method for 6-Motifs with Low Connectivity