NDLI: Community Detection in Networks via Nonlinear Modularity Eigenvectors

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Hein, Matthias Tudisco, Francesco Mercado, Pedro
Copyright Year	2018
Abstract	Revealing a community structure in a network or dataset is a central problem arising in many scientific areas. The modularity function $Q$ is an established measure quantifying the quality of a community, being identified as a set of nodes having high modularity. In our terminology, a set of nodes with positive modularity is called a module and a set that maximizes $Q$ is thus called a leading module. Finding a leading module in a network is an important task; however, the dimension of real-world problems makes the maximization of $Q$ unfeasible. This poses the need of approximation techniques which are typically based on a linear relaxation of $Q$, induced by the spectrum of the modularity matrix $M$. In this work we propose a nonlinear relaxation which is instead based on the spectrum of a nonlinear modularity operator ${\mathcal M}$. We show that extremal eigenvalues of ${\mathcal M}$ provide an exact relaxation of the modularity measure $Q$, in the sense that the maximum eigenvalue of ${\mathcal M}$ is equal to the maximum value of $Q$, although at the price of being more challenging to be computed than those of $M$. Thus we extend the work made on nonlinear Laplacians by proposing a computational scheme, named generalized RatioDCA, to address such extremal eigenvalues. We show monotonic ascent and convergence of the method. We finally apply the new method to several synthetic and real-world datasets, showing both effectiveness of the model and performance of the method.
Sponsorship	Marie Curie Individual Fellowship. H2020 European Research Council
Starting Page	2393
Ending Page	2419
Page Count	27
File Format	PDF
ISSN	00361399
DOI	10.1137/17M1144143
e-ISSN	1095712X
Issue Number	5
Volume Number	78
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2018-09-06
Access Restriction	Subscribed
Subject Keyword	Factorization, matching, partitioning, covering and packing nonlinear eigenvalues Graphs and linear algebra Particular nonlinear operators Graph theory graph modularity Cheeger inequality community detection spectral partitioning
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Algebraic Analysis of the Graph Modularity

Community detection in networks via nonlinear modularity eigenvectors

Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

An algebraic analysis of the graph modularity

Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees

Symplectic Spaces And Ear-Decomposition Of Matroids

Graphs isomorphic to their maximum matching graphs

On the Quality of Spectral Separators

Packing $k$-Matchings and $k$-Critical Graphs

Community Detection in Networks via Nonlinear Modularity Eigenvectors

Similar Documents

An Algebraic Analysis of the Graph Modularity

Community detection in networks via nonlinear modularity eigenvectors

Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs

An algebraic analysis of the graph modularity

Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees

Symplectic Spaces And Ear-Decomposition Of Matroids

Graphs isomorphic to their maximum matching graphs

On the Quality of Spectral Separators

Packing $k$-Matchings and $k$-Critical Graphs

Community Detection in Networks via Nonlinear Modularity Eigenvectors