A simple and efficient algorithm for modeling modular complex networks

DOI10.1016/J.PHYSA.2017.04.111MaRDI QIDQ2147643zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

algorithmscomplex networkscommunity structure

Mathematics Subject Classification ID

Applications of statistics to social sciences (62P25) Social networks; opinion dynamics (91D30)

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 critical point for random graphs with a given degree sequence
• A survey of statistical network models
• Community structure in social and biological networks
• Consistency under sampling of exponential random graph models
• Critical line in undirected Kauffman Boolean networks — the role of percolation
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Mixed membership stochastic blockmodels
• Networks. An introduction.

Cited in

(6)

• Generating structure specific networks
• Generation of arbitrary two-point correlated directed networks with given modularity
• Improving heuristics for network modularity maximization using an exact algorithm
• Modularity of complex networks models
• The modular structure of Kauffman networks
• Algorithm for detecting module structure in complex networks based on node type

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)