Fast analytical methods for finding significant labeled graph motifs

DOI10.1007/S10618-017-0544-8MaRDI QIDQ1741244zbMATH OpenOpenAlexWikidataFDO

Authors Giovanni Micale, Rosalba Giugno, Alfredo Ferro, Misael Mongiovì, Dennis Shasha, Alfredo Pulvirenti

Publication date 3 May 2019

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-017-0544-8

zbMATH Keywords

graph algorithmslabeled graph motifsnetwork miningrandom network models

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Systems biology, networks (92C42)

Recommendations

• Fast methods for finding significant motifs on labelled multi-relational networks
• Large-scale network motif analysis using compression
• Network motifs: mean and variance for the count
• Detecting local network motifs
• Approximating the number of network motifs

Cites work

• Analytical maximum-likelihood method to detect patterns in real networks
• BOULWARE STATE IN EXACTLY SOLVABLE MODELS OF 2D DILATON GRAVITY
• Emergence of Scaling in Random Networks
• Estimation and Prediction for Stochastic Blockstructures
• G-Tries: a data structure for storing and finding subgraphs
• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 273667 (Why is no real title available?)
• The average distances in random graphs with given expected degrees

Cited in

(7)

• Fast methods for finding significant motifs on labelled multi-relational networks
• Network motifs: mean and variance for the count
• An analytical approach to network motif detection in samples of networks with pairwise different vertex labels
• A Fast Counting Method for 6-Motifs with Low Connectivity
• Engineering Motif Search for Large Graphs
• Parallel Discovery of Top-k Weighted Motifs in Large Graphs
• On the perception of small sub-graphs

Describes a project that uses

Uses Software

• ClueGO
• NeMoFinder
• GraphBase
• BiNGO

This page was built for publication: Fast analytical methods for finding significant labeled graph motifs

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