Generalized modularity matrices
From MaRDI portal
Publication:281985
DOI10.1016/J.LAA.2015.06.013zbMATH Open1335.05108arXiv1502.01139OpenAlexW2963186652MaRDI QIDQ281985FDOQ281985
Authors: Francesco Tudisco, Dario Fasino 
Publication date: 11 May 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1502.01139
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Special matrices (15B99)
Cites Work
- Title not available (Why is that?)
- Graph clustering
- Fast unfolding of communities in large networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi‐random graphs with given degree sequences
- Title not available (Why is that?)
- Graph partitioning by eigenvectors
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Community detection based on network communicability
- An algebraic analysis of the graph modularity
- Title not available (Why is that?)
- Perron-Frobenius theorem for matrices with some negative entries
- Discrete nodal domain theorems
Cited In (13)
- Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix
- Localization of dominant eigenpairs and planted communities by means of Frobenius inner products.
- A characterization of modularity in graphs
- On the stability of network indices defined by means of matrix functions
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- Community detection in networks via nonlinear modularity eigenvectors
- A modularity based spectral method for simultaneous community and anti-community detection
- An algebraic analysis of the graph modularity
- Spectral properties of modularity matrices
- Matrix and discrepancy view of generalized random and quasirandom graphs
- Node and Layer Eigenvector Centralities for Multiplex Networks
- Mesoscopic analysis of networks: applications to exploratory analysis and data clustering
- Total variation based community detection using a nonlinear optimization approach
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)
