Detecting local network motifs
From MaRDI portal
Publication:1950844
DOI10.1214/12-EJS698zbMath1281.05124arXiv1007.1410OpenAlexW2963381982MaRDI QIDQ1950844
Publication date: 28 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.1410
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)
Related Items (1)
Uses Software
Cites Work
- Overlapping stochastic block models with application to the French political blogosphere
- Fast online graph clustering via Erdős-Rényi mixture
- Poisson approximation for dependent trials
- Concentration inequalities using the entropy method
- Upper tails for subgraph counts in random graphs
- Mixed membership stochastic blockmodels
- A functional limit theorem for random graphs with applications to subgraph count statistics
- Estimation and Prediction for Stochastic Blockstructures
- Collective dynamics of ‘small-world’ networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Detecting local network motifs