NDLI: Modularity-maximizing graph communities via mathematical programming

Content Provider	Springer Nature Link
Author	Agarwal, G. Kempe, D.
Copyright Year	2008
Abstract	In many networks, it is of great interest to identify communities, unusually densely knit groups of individuals. Such communities often shed light on the function of the networks or underlying properties of the individuals. Recently, Newman suggested modularity as a natural measure of the quality of a network partitioning into communities. Since then, various algorithms have been proposed for (approximately) maximizing the modularity of the partitioning determined. In this paper, we introduce the technique of rounding mathematical programs to the problem of modularity maximization, presenting two novel algorithms. More specifically, the algorithms round solutions to linear and vector programs. Importantly, the linear programing algorithm comes with an a posteriori approximation guarantee: by comparing the solution quality to the fractional solution of the linear program, a bound on the available “room for improvement” can be obtained. The vector programming algorithm provides a similar bound for the best partition into two communities. We evaluate both algorithms using experiments on several standard test cases for network partitioning algorithms, and find that they perform comparably or better than past algorithms, while being more efficient than exhaustive techniques.
Starting Page	409
Ending Page	418
Page Count	10
File Format	PDF
ISSN	14346028
Journal	The European Physical Journal B
Volume Number	66
Issue Number	3
e-ISSN	14346036
Language	English
Publisher	Springer-Verlag
Publisher Date	2008-11-27
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Superconductivity, Superfluidity, Quantum Fluids Solid State Physics and Spectroscopy Fluids Complexity Physics Condensed Matter
Content Type	Text
Resource Type	Article
Subject	Electronic, Optical and Magnetic Materials Condensed Matter Physics

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

Deterministic modularity optimization

Urban traffic from the perspective of dual graph

Rashba billiards

Reciprocating nanoengine

Cascade defense via navigation in scale free networks

Optical bistability via tunable Fano-type interference in asymmetric semiconductor quantum wells

Evolving pseudofractal networks

Quantum thermal transport in nanostructures

Nonlinear magnetic response in ruthenocuprates

Modularity-maximizing graph communities via mathematical programming

Similar Documents

Deterministic modularity optimization

Urban traffic from the perspective of dual graph

Rashba billiards

Reciprocating nanoengine

Cascade defense via navigation in scale free networks

Optical bistability via tunable Fano-type interference in asymmetric semiconductor quantum wells

Evolving pseudofractal networks

Quantum thermal transport in nanostructures

Nonlinear magnetic response in ruthenocuprates

Modularity-maximizing graph communities via mathematical programming