Birmingham University

For a fixed degree sequence D=(d_1,...,d_n), let G(D) be a uniformly chosen (simple) graph on {1,...,n} where the vertex i has degree d_i. The study of G(D) is of special interest in order to model real-world networks that can be described by their degree sequence, such as scale-free networks. While many aspects of G(D) have been extensively studied, most of the obtained results only hold provided that the degree sequence D satisfies some technical conditions. In this talk we will introduce a new approach (based on the switching method) that allows us to study the random graph G(D) imposing no conditions on D. Most notably, this approach provides a new criterion on the existence of a giant component in G(D). Moreover, this method is also useful to determine whether there exists a percolation threshold in G(D). The first part of this talk is joint work with F. Joos, D. Rautenbach and B. Reed, and the second part, with N. Fountoulakis and F. Joos.

The aim of this talk is to design an efficient multigrid method for constrained convex optimization problems arising from discretization  of  some  underlying  infinite  dimensional  problems. Due  to problem  dependency  of this approach, we only consider bound constraints with (possibly) a linear equality constraint. As our aim is to target large-scale problems, we want to avoid computation of second 
derivatives of the objective function, thus excluding Newton like methods. We propose a smoothing operator that only uses first-order information and study the computational efficiency of the resulting method. In the second part, we consider application of multigrid techniques to more general optimization problems, in particular, the topology design problem.

We know that the existence of a period three point for an interval map implies much about the dynamics of the map, but the restriction of the map to the periodic orbit itself is trivial. Countable invariant subsets arise naturally in many dynamical systems, for example as $\omega$-limit sets, but many of the usual notions of dynamics degenerate when restricted to countable sets. In this talk we look at what we can say about dynamics on countable compact spaces.  In particular, the theory of countable dynamical systems is the theory of the induced dynamics on countable invariant subsets of the interval and the theory of homeomorphic countable dynamics is the theory of compact countable invariant subsets of homeomorphisms of the plane.

Joint work with Columba Perez

TBA