Community Structure Of Complex Networks

Community structure is a salient structural characteristic of many real-world networks. Communities are generally hierarchical, overlapping, multi-scale and coexist with other types of structural regularities of networks. This poses major challenges for conventional methods of community detection. This book will comprehensively introduce the latest advances in community detection, especially the detection of overlapping and hierarchical community structures, the detection of multi-scale communities in heterogeneous networks, and the exploration of multiple types of structural regularities. These advances have been successfully applied to analyze large-scale online social networks, such as Facebook and Twitter. This book provides readers a convenient way to grasp the cutting edge of community detection in complex networks. The thesis on which this book is based was honored with the “Top 100 Excellent Doctoral Dissertations Award” from the Chinese Academy of Sciences and was nominated as the “Outstanding Doctoral Dissertation” by the Chinese Computer Federation.

This book constitutes the refereed proceedings of the joint conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2008, held in Antwerp, Belgium, in September 2008. The 100 papers presented in two volumes, together with 5 invited talks, were carefully reviewed and selected from 521 submissions. In addition to the regular papers the volume contains 14 abstracts of papers appearing in full version in the Machine Learning Journal and the Knowledge Discovery and Databases Journal of Springer. The conference intends to provide an international forum for the discussion of the latest high quality research results in all areas related to machine learning and knowledge discovery in databases. The topics addressed are application of machine learning and data mining methods to real-world problems, particularly exploratory research that describes novel learning and mining tasks and applications requiring non-standard techniques.

Networks can provide a useful model and graphic image useful for the description of a wide variety of web-like structures in the physical and man-made realms, e.g. protein networks, food webs and the Internet. The contributions gathered in the present volume provide both an introduction to, and an overview of, the multifaceted phenomenology of complex networks. Statistical Mechanics of Complex Networks also provides a state-of-the-art picture of current theoretical methods and approaches.

The book integrates approaches from mathematics, physics and computer sciences to analyse the organisation of complex networks. Every organisational principle of networks is defined, quantified and then analysed for its influences on the properties and functions of molecular, biological, ecological and social networks.

This book is the culmination of three years of research effort on a multidisciplinary project in which physicists, mathematicians, computer scientists and social scientists worked together to arrive at a unifying picture of complex networks. The contributed chapters form a reference for the various problems in data analysis visualization and modeling of complex networks.

Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to "discrete" as well as "continuous" problems. Spectral Algorithms describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. The first part of the book presents applications of spectral methods to problems from a variety of topics including combinatorial optimization, learning and clustering. The second part of the book is motivated by efficiency considerations. A feature of many modern applications is the massive amount of input data. While sophisticated algorithms for matrix computations have been developed over a century, a more recent development is algorithms based on "sampling on the fly" from massive matrices. Good estimates of singular values and low rank approximations of the whole matrix can be provably derived from a sample. The main emphasis in the second part of the book is to present these sampling methods with rigorous error bounds. It also presents recent extensions of spectral methods from matrices to tensors and their applications to some combinatorial optimization problems.

This book presents new and innovative current discoveries in social networking which contribute enough knowledge to the research community. The book includes chapters presenting research advances in social network analysis and issues emerged with diverse social media data. The book also presents applications of the theoretical algorithms and network models to analyze real-world large-scale social networks and the data emanating from them as well as characterize the topology and behavior of these networks. Furthermore, the book covers extremely debated topics, surveys, future trends, issues, and challenges.

Complex networks such as the Internet, WWW, transportation networks, power grids, biological neural networks, and scientific cooperation networks of all kinds provide challenges for future technological development. • The first systematic presentation of dynamical evolving networks, with many up-to-date applications and homework projects to enhance study • The authors are all very active and well-known in the rapidly evolving field of complex networks • Complex networks are becoming an increasingly important area of research • Presented in a logical, constructive style, from basic through to complex, examining algorithms, through to construct networks and research challenges of the future