Graph and Information-theoretic Methods for Analyzing Complex Networks
 
 
Description:  The analysis of graph-based systems is currently an ongoing and outstanding research topic. It turned out that especially techniques for measuring graph similarity are extremely important. In this talk I will outline some existing and novel methods to measure the structural similarity of graphs. Further, the problem of analyzing information processing in networks will be adressed. For this, I present a novel method to determine the entropy of a network that is interpreted as the structural information content. To outline future research and to apply such methods to a challenging problem in computational biology, I will outline the problem of detecting complex diseases by means of graphs.
Area(s):
Date:  2007-11-29
Start Time:   14:30
Speaker:  Mathias Dehmer (Vienna University of Technology)
Place:  Room 5.5
Research Groups: -Probability and Statistics
See more:   <Main>  
 
© Centre for Mathematics, University of Coimbra, funded by
Science and Technology Foundation
Powered by: rdOnWeb v1.4 | technical support