Network Modularity in the Presence of Covariates

DOI10.1137/17M1111528zbMath1423.90032arXiv1603.01214OpenAlexW2962831382WikidataQ127945024 ScholiaQ127945024MaRDI QIDQ5232334

Beate Ehrhardt, Patrick J. Wolfe

Publication date: 2 September 2019

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.01214

zbMATH Keywords

limit theoremsstatistical network analysisnetwork community structuredegree-based network models

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Modularity of Erdős‐Rényi random graphs

Uses Software

• plfit

Cites Work

• Unnamed Item
• Community detection in networks with node features
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Community detection in dense random networks
• From the Cover: The structure of scientific collaboration networks
• Power-Law Distributions in Empirical Data
• Latent Space Approaches to Social Network Analysis
• Point Process Modelling for Directed Interaction Networks
• Testing and Modeling Dependencies Between a Network and Nodal Attributes
• Random Dot Product Graph Models for Social Networks
• The average distances in random graphs with given expected degrees
• Hypothesis Testing for Automated Community Detection in Networks