|
|
|
|
|
|
|
Free Newsletters
Archive
My Subscriptions
News by Subject
News by Disease
News by Date
PLoS
Search News
Post Your News
JoVE
Job Seeker Login
Most Recent Jobs
Browse Biotech Jobs
Search Jobs
Post Resume
Career Fairs
Career Resources
For Employers
Regional News
US & Canada
Biotech Bay
Biotech Beach
Genetown
Pharm Country
BioCapital
BioMidwest
Bio NC
BioForest
Southern Pharm
BioCanada East
US Device
Europe
Asia
Market Summary
News
IPOs
Company Profiles
Companies
Events
Research Store
Biotech Events
Post an Event
Real Estate
Business Opportunities
|
|
|
|
PLoS By Category | Recent
PLoS Articles
|
|
Computer Science - Mathematics - Neuroscience
|
Deciphering Network Community Structure by Surprise
Published:
Thursday, September 01, 2011
Author:
Rodrigo Aldecoa et al.
by Rodrigo Aldecoa, Ignacio Marín
The analysis of complex networks permeates all sciences, from biology to sociology. A fundamental, unsolved problem is how to characterize the community structure of a network. Here, using both standard and novel benchmarks, we show that maximization of a simple global parameter, which we call Surprise (S), leads to a very efficient characterization of the community structure of complex synthetic networks. Particularly, S qualitatively outperforms the most commonly used criterion to define communities, Newman and Girvan's modularity (Q). Applying S maximization to real networks often provides natural, well-supported partitions, but also sometimes counterintuitive solutions that expose the limitations of our previous knowledge. These results indicate that it is possible to define an effective global criterion for community structure and open new routes for the understanding of complex networks.
More...
|
|
|
 |
|
|
|
|
|
|
|
|