A Fast Counting Method for 6-Motifs with Low Connectivity

DOI10.1007/978-3-030-43120-4_25MaRDI QIDQ5014689zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Approximating the number of network motifs
• Approximating the Number of Network Motifs
• Large-scale network motif analysis using compression
• Fast analytical methods for finding significant labeled graph motifs
• Motif discovery in networks: a survey

Cites work

• Approximating the number of network motifs
• Collective dynamics of `small-world' networks
• Triad count statistics
• Triangle sparsifiers
• Wedge sampling for computing clustering coefficients and triangle counts on large graphs^†

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014689)