Handbook of Optimization in Complex Networks: Theory and Applications
My T. Thai, Panos M. Pardalos
Springer Science & Business Media, Dec 19, 2011 - Mathematics - 546 pages
Complex Social Networks is a newly emerging (hot) topic with applications in a variety of domains, such as communication networks, engineering networks, social networks, and biological networks. In the last decade, there has been an explosive growth of research on complex real-world networks, a theme that is becoming pervasive in many disciplines, ranging from mathematics and computer science to the social and biological sciences. Optimization of complex communication networks requires a deep understanding of the interplay between the dynamics of the physical network and the information dynamics within the network. Although there are a few books addressing social networks or complex networks, none of them has specially focused on the optimization perspective of studying these networks. This book provides the basic theory of complex networks with several new mathematical approaches and optimization techniques to design and analyze dynamic complex networks. A wide range of applications and optimization problems derived from research areas such as cellular and molecular chemistry, operations research, brain physiology, epidemiology, and ecology.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
application approach approximation average path length bandwidth behavior Blogs bound citations clustering coefficient community structure complex networks component computed connected consider constraints cooperation corresponding defectors defined degree distribution degree sequence denote density disjoint paths double Pareto lognormal dynamic network eigenvalues epidemic exponential fitness ﬂow flow problem formulation given graph G groups heterogeneous k-core heuristic host hubs inapproximability infected iteration k-core Laplacian Laplacian matrix Lemma lognormal distribution LP relaxation malicious mathematical maximal independent sets maximum methods minimum cost misprints modularity neighbors nodes number of edges optimal substructure overlap pair papers parameter Pareto distribution partitions path problem Phys power-law graphs probability r-hop neighborhood random graphs random network scale-free networks Sect service migration SF networks shortest path simulations small-world networks solving subgraph synchronization Theorem threshold topology total number transition tree users variable vertex weights