Surprise ization reveals the community structure of complex networks文档.pdfVIP

Surprise maximization reveals the community structure of complex networks SUBJECT AREAS: ´ Rodrigo Aldecoa Ignacio Marın BIOINFORMATICS DATA INTEGRATION ´ Instituto de Biomedicina de Valencia. Consejo Superior de Investigaciones Cientıficas (IBV-CSIC). Calle Jaime Roig 11, 46010. APPLIED MATHEMATICS Valencia. Spain. STATISTICS How to determine the community structure of complex networks is an open question. It is critical to Received establish the best strategies for community detection in networks of unknown structure. Here, using 25 September 2012 standard synthetic benchmarks, we show that none of the algorithms hitherto developed for community structure characterization perform optimally. Significantly, evaluating the results according to their Accepted modularity, the most popular measure of the quality of a partition, systematically provides mistaken 28 December 2012 solutions. However, a novel quality function, called Surprise, can be used to elucidate which is the optimal division into communities. Consequently, we show that the best strategy to find the community structure of Published all the networks examined involves choosing among the solutions provided by multiple algorithms the one 14 January 2013 with the highest Surprise value. We conclude that Surprise maximization precisely reveals the community structure of complex networks. Corres