Complex networks in climate dynamics - Comparing linear and nonlinear network construction methods

Complex network theory provides a powerful framework to statistically investigate the topology of local and non-local statistical interrelationships, i.e. teleconnections, in the climate system. Climate networks constructed from the same global climatological data set using the linear Pearson correlation coefficient or the nonlinear mutual information as a measure of dynamical similarity between regions, are compared systematically on local, mesoscopic and global topological scales. A high degree of similarity is observed on the local and mesoscopic topological scales for surface air temperature fields taken from AOGCM and reanalysis data sets. We find larger differences on the global scale, particularly in the betweenness centrality field. The global scale view on climate networks obtained using mutual information offers promising new perspectives for detecting network structures based on nonlinear physical processes in the climate system.Comment: 24 pages, 10 figure

Generic multiloop methods and application to N=4 super-Yang-Mills

We review some recent additions to the tool-chest of techniques for finding compact integrand representations of multiloop gauge-theory amplitudes - including non-planar contributions - applicable for N=4 super-Yang-Mills in four and higher dimensions, as well as for theories with less supersymmetry. We discuss a general organization of amplitudes in terms of purely cubic graphs, review the method of maximal cuts, as well as some special D-dimensional recursive cuts, and conclude by describing the efficient organization of amplitudes resulting from the conjectured duality between color and kinematic structures on constituent graphs.Comment: 42 pages, 18 figures, invited review for a special issue of Journal of Physics A devoted to "Scattering Amplitudes in Gauge Theories", v2 minor corrections, v3 added reference

Approximating the Minimum Equivalent Digraph

The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives an approximation algorithm with performance guarantee of pi^2/6 ~ 1.64. The algorithm and its analysis are based on the simple idea of contracting long cycles. (This result is strengthened slightly in ``On strongly connected digraphs with bounded cycle length'' (1996).) The analysis applies directly to 2-Exchange, a simple ``local improvement'' algorithm, showing that its performance guarantee is 1.75.Comment: conference version in ACM-SIAM Symposium on Discrete Algorithms (1994