Detecting local network motifs
From MaRDI portal
Abstract: Studying the topology of so-called real networks, that is networks obtained from sociological or biological data for instance, has become a major field of interest in the last decade. One way to deal with it is to consider that networks are built from small functional units called motifs, which can be found by looking for small subgraphs whose numbers of occurrences in the whole network are surprisingly high. In this article, we propose to define motifs through a local overrepresentation in the network and develop a statistic to detect them without relying on simulations. We then illustrate the performance of our procedure on simulated and real data, recovering already known biologically relevant motifs. Moreover, we explain how our method gives some information about the respective roles of the vertices in a motif.
Recommendations
Cites work
- A functional limit theorem for random graphs with applications to subgraph count statistics
- Collective dynamics of `small-world' networks
- Complex graphs and networks
- Concentration inequalities using the entropy method
- Estimation and Prediction for Stochastic Blockstructures
- Fast online graph clustering via Erdős-Rényi mixture
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- Mixed membership stochastic blockmodels
- Network motifs: mean and variance for the count
- Overlapping stochastic block models with application to the French political blogosphere
- Poisson approximation for dependent trials
- Upper tails for subgraph counts in random graphs
Cited in
(18)- Fast analytical methods for finding significant labeled graph motifs
- Motif discovery in networks: a survey
- Motif-based tests for bipartite networks
- Exploring local structural organization of metabolic networks using subgraph patterns
- Bayesian analysis of biological networks: clusters, motifs, cross-species correlations
- Temporal changes in local topology of an email-based social network
- Research and design of a statistical way for Motif in networks
- Motif formation and industry specific topologies in the Japanese business firm network
- Motifs stability in hierarchical modular networks
- Approximating the Number of Network Motifs
- Network motifs: mean and variance for the count
- Motifs for processes on networks
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Approximating the number of network motifs
- Transactions on Computational Systems Biology III
- Local motif clustering via (hyper)graph partitioning
- Motifs in evolving cooperative networks look like protein structure networks
- Bayesian models and Gibbs sampling strategies for local graph alignment and motif identification in stochastic biological networks
This page was built for publication: Detecting local network motifs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950844)
