Generalized modularity matrices

DOI10.1016/J.LAA.2015.06.013MaRDI QIDQ281985zbMATHOpenAlexFDO

Authors Francesco Tudisco, Dario Fasino

Publication date 11 May 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

community detectionmodularity matrixnodal domains

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Special matrices (15B99)

Abstract: Various modularity matrices appeared in the recent literature on network analysis and algebraic graph theory. Their purpose is to allow writing as quadratic forms certain combinatorial functions appearing in the framework of graph clustering problems. In this paper we put in evidence certain common traits of various modularity matrices and shed light on their spectral properties that are at the basis of various theoretical results and practical spectral-type algorithms for community detection.

Recommendations

• Spectral properties of modularity matrices
• Assessing modularity using a random matrix theory approach
• Uncovering generalized-network structure in matrices
• Modularity in several random graph models
• Modularity of complex networks models
• Approximate modularity revisited
• Approximate modularity revisited
• Modularity Maximization for Graphons
• Generalized Matrices

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• An algebraic analysis of the graph modularity
• Community detection based on network communicability
• Discrete nodal domain theorems
• Fast unfolding of communities in large networks
• Graph clustering
• Graph partitioning by eigenvectors
• Perron-Frobenius theorem for matrices with some negative entries
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Quasi‐random graphs with given degree sequences

Cited in

(13)

• On the stability of network indices defined by means of matrix functions
• Localization of dominant eigenpairs and planted communities by means of Frobenius inner products.
• Total variation based community detection using a nonlinear optimization approach
• Matrix and discrepancy view of generalized random and quasirandom graphs
• Community detection in networks via nonlinear modularity eigenvectors
• A characterization of modularity in graphs
• Node and Layer Eigenvector Centralities for Multiplex Networks
• An algebraic analysis of the graph modularity
• A modularity based spectral method for simultaneous community and anti-community detection
• Spectral properties of modularity matrices
• Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix
• The expected adjacency and modularity matrices in the degree corrected stochastic block model
• Mesoscopic analysis of networks: applications to exploratory analysis and data clustering

This page was built for publication: Generalized modularity matrices

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