University of Oxford

As early as the 1920's Marshall suggested that firms co-locate in cities to reduce the costs of moving goods, people, and ideas. These 'forces of agglomeration' have given rise, for example, to the high tech clusters of San Francisco and Boston, and the automobile cluster in Detroit. Yet, despite its importance for city planners and industrial policy-makers, until recently there has been little success in estimating the relative importance of each Marshallian channel to the location decisions of firms.
Here we explore a burgeoning literature that aims to exploit the co-location patterns of industries in cities in order to disentangle the relationship between industry co-agglomeration and customer/supplier, labour and idea sharing. Building on previous approaches that focus on across- and between-industry estimates, we propose a network-based method to estimate the relative importance of each Marshallian channel at a meso scale. Specifically, we use a community detection technique to construct a hierarchical decomposition of the full set of industries into clusters based on co-agglomeration patterns, and show that these industry clusters exhibit distinct patterns in terms of their relative reliance on individual Marshallian channels.

The second part is to use industry relatedness, which we measure via a similar metric to co-location, to better understand the association of industrial emissions to city-industry agglomeration. Specifically, we see that industrial emissions (which are the largest source of greenhouse emissions in the US) are highly tied to certain industries, and furthermore that communities in the industry relatedness network tend to explain the tendency of particular industry clusters to produce emissions. This is important, because it limits cities' abilities to move to a greener industry basket as some cities may be more or less constrained to highly polluting industry clusters, while others have more potential for diversification away from polluting industries.

Finitely presented groups are a natural algebraic generalisation of the collection of finite groups. Unlike the finite case there is almost no hope of any kind of classification.

The goal of random groups is therefore to understand the properties of the "typical" finitely presented group. I will present a couple of models for random groups and survey some of the main theorems and open questions in the area, demonstrating surprising correlations between these probabilistic models, geometry and analysis.

We consider the coordinate-iterated-integral as an algebraic product on the shuffle algebra, called the (right) half-shuffle product. Its anti-symmetrization defines the biproduct  area(.,.), interpretable as the signed-area between two real-valued coordinate paths. We consider specific sets of binary, rooted trees known as Hall sets. These set have a complex combinatorial structure, which can be almost entirely circumvented by introducing the equivalent notion of Lazard sets. Using analytic results from dynamical systems and algebraic results from the theory of Lie algebras, we show that shuffle-polynomials in areas-of-areas on Hall trees generate the shuffle algebra.

I will elaborate on some recent developments on the theory of special functions which are relevant to the calculation of Feynman integrals in perturbative quantum field theory, highlighting the connections with some recent ideas in pure mathematics.