Structural Analysis of Complex Networks

Front Cover
Matthias Dehmer
Springer Science & Business Media, Oct 14, 2010 - Mathematics - 486 pages

Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately.

Filling a gap in literature, this self-contained book presents theoretical and application-oriented results to structurally explore complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems.

Special emphasis is given to methods related to the following areas:

* Applications to biology, chemistry, linguistics, and data analysis

* Graph colorings

* Graph polynomials

* Information measures for graphs

* Metrical properties of graphs

* Partitions and decompositions

* Quantitative graph measures

Structural Analysis of Complex Networks is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science, machine learning, artificial intelligence, computational and systems biology, cognitive science, computational linguistics, and mathematical chemistry. The book may be used as a supplementary textbook in graduate-level seminars on structural graph analysis, complex networks, or network-based machine learning methods.


What people are saying - Write a review

We haven't found any reviews in the usual places.


Chapter 1 A Brief Introduction to Complex Networksand Their Analysis
Chapter 2 Partitions of Graphs
Chapter 3 Distance in Graphs
Chapter 4 Domination in Graphs
Chapter 5 Spectrum and Entropy for Infinite Directed Graphs
Chapter 6 Application of Infinite Labeled Graphs to Symbolic Dynamical Systems
Chapter 7 Decompositions and Factorizations of Complete Graphs
Chapter 8 Geodetic Sets in Graphs
Chapter 12 Subgraphs as a Measure of Similarity
Chapter 13 A Chromatic Metric on Graphs
Chapter 14 Some Applications of Eigenvalues of Graphs
Chapter 15 Minimum Spanning Markovian Trees Introducing ContextSensitivity into the Generation of Spanning Trees
Chapter 16 LinkBased Network Mining
Chapter 17 Graph Representations and Algorithms in Computational Biology of RNA Secondary Structure
Chapter 18 Inference of Protein Function from the Structureof Interaction Networks
Chapter 19 Applications of Perfect Matchings in Chemistry

Chapter 9 Graph Polynomials and Their Applications IThe Tutte Polynomial
Chapter 10 Graph Polynomials and Their Applications II Interrelations and Interpretations
Chapter 11 Reconstruction Problems for Graphs Krawtchouk Polynomials and Diophantine Equations

Other editions - View all

Common terms and phrases

About the author (2010)

Frank Emmert-Streib studied physics at the University of Siegen, Germany, and received his PhD in Theoretical Physics from the University of Bremen, Germany. He is currently Senior Fellow at the University of Washington in Seattle, USA, in Biostatistics and Genome Sciences.
Matthias Dehmer studied mathematics at the University of Siegen, Germany, and received his PhD in Computer Science from the Technical University of Darmstadt, Germany. Currently, he holds a research position at Vienna University of Technology, Institute of Discrete Mathematics and Geometry in Vienna, Austria.

Bibliographic information