Detecting local network motifs
From MaRDI portal
Publication:1950844
DOI10.1214/12-EJS698zbMATH Open1281.05124arXiv1007.1410OpenAlexW2963381982MaRDI QIDQ1950844FDOQ1950844
Authors: Etienne Birmelé 
Publication date: 28 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1007.1410
Recommendations
Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- Estimation and Prediction for Stochastic Blockstructures
- Mixed membership stochastic blockmodels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Overlapping stochastic block models with application to the French political blogosphere
- Fast online graph clustering via Erdős-Rényi mixture
- Collective dynamics of `small-world' networks
- Concentration inequalities using the entropy method
- Title not available (Why is that?)
- Complex graphs and networks
- Title not available (Why is that?)
- Poisson approximation for dependent trials
- Upper tails for subgraph counts in random graphs
- A functional limit theorem for random graphs with applications to subgraph count statistics
- Network motifs: mean and variance for the count
Cited In (18)
- Bayesian models and Gibbs sampling strategies for local graph alignment and motif identification in stochastic biological networks
- Motifs stability in hierarchical modular networks
- Exploring local structural organization of metabolic networks using subgraph patterns
- Approximating the Number of Network Motifs
- Temporal changes in local topology of an email-based social network
- Motif formation and industry specific topologies in the Japanese business firm network
- Transactions on Computational Systems Biology III
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Fast analytical methods for finding significant labeled graph motifs
- Research and design of a statistical way for Motif in networks
- Motif discovery in networks: a survey
- Motif-based tests for bipartite networks
- Bayesian analysis of biological networks: clusters, motifs, cross-species correlations
- Network motifs: mean and variance for the count
- Motifs in evolving cooperative networks look like protein structure networks
- Local motif clustering via (hyper)graph partitioning
- Approximating the number of network motifs
- Motifs for processes on networks
Uses Software
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)
