Dresden 2009 – wissenschaftliches Programm

Bereiche | Tage | Auswahl | Suche | Downloads | Hilfe

DY: Fachverband Dynamik und Statistische Physik

DY 29: Statistical physics of complex networks

DY 29.10: Vortrag

Freitag, 27. März 2009, 12:45–13:00, ZEU 255

Applying statistical complexity measures to networks — •Eckehard Olbrich, Thomas Kahle, Nils Bertschinger, and Jürgen Jost — Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany

Statistical complexity measures such as the excess entropy are well established in the context of time series and were recently generalized to quantify the complexity of joint probability distributions in general. We discuss, how statistical complexity measures can be applied to quantify structural properties of graphs.

In particular, we propose the interaction complexity – a recently introduced vector valued complexity measure, whose components quantify the complexity in terms of k-th order statistical dependencies that cannot be explained by interactions between k−1 units – as a general and systematic framework for analyzing the subgraph (motif) statistics of complex networks.