NDLI: Maximum modular graphs

Content Provider	Springer Nature Link
Author	Trajavski, S. Wang, H. Mieghem, P.
Copyright Year	2012
Abstract	Modularity has been explored as an important quantitative metric for community and cluster detection in networks. Finding the maximum modularity of a given graph has been proven to be NP-complete and therefore, several heuristic algorithms have been proposed. We investigate the problem of finding the maximum modularity of classes of graphs that have the same number of links and/or nodes and determine analytical upper bounds. Moreover, from the set of all connected graphs with a fixed number of links and/or number of nodes, we construct graphs that can attain maximum modularity, named maximum modular graphs. The maximum modularity is shown to depend on the residue obtained when the number of links is divided by the number of communities. Two applications in transportation networks and data-centers design that can benefit of maximum modular partitioning are proposed.
Starting Page	1
Ending Page	14
Page Count	14
File Format	PDF
ISSN	14346028
Journal	The European Physical Journal B
Volume Number	85
Issue Number	7
e-ISSN	14346036
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-07-18
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Statistical and Nonlinear Physics Physics Condensed Matter Physics Fluid- and Aerodynamics Solid State Physics Statistical Physics, Dynamical Systems and Complexity
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

Percolation threshold on planar Euclidean Gabriel graphs

Localization of eigenvectors in random graphs

Degree correlation in scale-free graphs

A maximum entropy model for opinions in social groups

Assortativity of complementary graphs

MaxEnt and dynamical information

Dynamical continuous time random walk

The prescribed output pattern regulates the modular structure of flow networks

The maximum entropy principle applied to a dynamical system proposed by Lorenz

Maximum modular graphs

Similar Documents

Percolation threshold on planar Euclidean Gabriel graphs

Localization of eigenvectors in random graphs

Degree correlation in scale-free graphs

A maximum entropy model for opinions in social groups

Assortativity of complementary graphs

MaxEnt and dynamical information

Dynamical continuous time random walk

The prescribed output pattern regulates the modular structure of flow networks

The maximum entropy principle applied to a dynamical system proposed by Lorenz

Maximum modular graphs