scientific article; zbMATH DE number 5533285

MaRDI QIDQ3616679zbMATH OpenFDO

Authors James Scanlon, Narsingh Deo

Publication date 26 March 2009

zbMATH Keywords

degree distributionglobally sparse graphsgraph modellocally dense graphsnetwork model

Mathematics Subject Classification ID

Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) Applications of graph theory (05C90) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Optimal Estimation of the Number of Network Communities
• COMMUNITY FINDING IN COMPLEX NETWORKS
• Community structures of networks
• Community detection based on network communicability
• Network community detection using modularity density measures
• Community structure in large complex networks

Cited in

(17)

• Complete graph model for community detection
• Basic networks: definition and applications
• Principles of network computing
• Community structures in classical network models
• A network function-based definition of communities in complex networks
• Maximising the worth of nascent networks
• Community identification algorithm using relative edge density measure
• A complex network approach to cloud computing
• Minimal paths between communities induced by geographical networks
• Communities in Large Networks: Identification and Ranking
• Community structure in large complex networks
• COMMUNITY, HIERARCHY AND INTERWEAVEMENT IN COLLABORATION NETWORKS
• Density decompositions of networks
• Mixing patterns and community structure in networks
• Self-similarity of communities of the ABCD model
• Remarks on network community properties
• Communicability graph and community structures in complex networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616679)