Analysis of Complex Networks From Biology to Linguistics

Mathematical problems such as graph theory problems are of increasing importance for the analysis of modelling data in biomedical research such as in systems biology, neuronal network modelling etc. This book follows a new approach of including graph theory from a mathematical perspective with specific applications of graph theory in biomedical and computational sciences. The book is written by renowned experts in the field and offers valuable background information for a wide audience.

Matthias Dehmer studied mathematics at the University of Siegen (Germany) and received his Ph.D. in computer science from the Technical University of Darmstadt (Germany). Currently, he is with the Vienna University of Technology (Austria) in the department of Discrete Mathematics and Geometry. His research interests are Graph Theory, Information Theory, Computational Biology and Machine Learning.

Frank Emmert-Streib studied Physics at the University of Siegen (Germany) and received his Ph.D. in Theoretical Physics form the University of Bremen (Germany). He was postdoctoral research associate at the Stowers Institute for Medical Research (Kansas City, USA) in the Department for Bioinformatics and is currently senior research fellow at the University of Washington (Seattle, USA) in Biostatistics and Genome Sciences. His research interests are in the field of Computational Biology, Biostatistics, Machine Learning and Information Theory and Statistical Learning.

Entropy, orbits and spectra of graphs (Moshowitz) Statistical mechanics of complex networks (Thurner) A simple integrated approach to network complexity and node centrality (Bonchev) Graph Spectra and the Structure of Complex Networks (Estrada) Random induced subgraphs of n-cubes (Reidys) Graph edit distance and applications (Bunke) Extremal problems in the theory of graph energy (Gutman) Generalised Shortest Paths Trees: A Novel Graph Class by Example of Semiotic Networks (Mehler) Applications of graph theory in chemo- and bioinformatics (Krissinel) Spatial, small-world, multiple-cluster, and spreading properties for neural systems (Kaiser) Network Homomorphisms with Applications to Mapping of Metabolic Pathways (Zelikovsky) Graph structure analysis and computational tractability of scheduling problems (Sevastyanov) Counting cubes in median graphs and related problems (Kovse) Elementary polycycle decomposition (Dutour , Deza) Optimal Dynamic Flows in Networks and Algorithms for their Finding (Lozovanu) Analyzing and modeling European R&D collaborations: Challenges and opportunities from a large social network (Austria) Analytic Combinatorics on Random Graphs (Drmota, Gittenberger)