A simple and efficient algorithm for modeling modular complex networks
From MaRDI portal
Publication:2147643
DOI10.1016/J.PHYSA.2017.04.111zbMATH Open1495.91094OpenAlexW2609929161WikidataQ62627453 ScholiaQ62627453MaRDI QIDQ2147643FDOQ2147643
Authors: Mateusz Kowalczyk, Piotr Fronczak, Agata Fronczak 
Publication date: 20 June 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2017.04.111
Recommendations
- Detecting network communities: a new systematic and efficient algorithm
- Algorithm for detecting module structure in complex networks based on node type
- Fast and accurate determination of modularity and its effect size
- Efficient generation of networks with given expected degrees
- A modularity degree based heuristic community detection algorithm
Cites Work
- A survey of statistical network models
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Mixed membership stochastic blockmodels
- Community structure in social and biological networks
- A critical point for random graphs with a given degree sequence
- Networks. An introduction.
- Consistency under sampling of exponential random graph models
- Critical line in undirected Kauffman Boolean networks — the role of percolation
Cited In (6)
- The modular structure of Kauffman networks
- Improving heuristics for network modularity maximization using an exact algorithm
- Algorithm for detecting module structure in complex networks based on node type
- Generation of arbitrary two-point correlated directed networks with given modularity
- Generating structure specific networks
- Modularity of complex networks models
This page was built for publication: A simple and efficient algorithm for modeling modular complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147643)
